./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/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.25-f470102 [2019-12-01 23:11:25,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 23:11:25,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 23:11:25,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 23:11:25,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 23:11:25,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 23:11:25,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 23:11:25,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 23:11:25,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 23:11:25,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 23:11:25,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 23:11:25,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 23:11:25,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 23:11:25,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 23:11:25,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 23:11:25,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 23:11:25,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 23:11:25,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 23:11:25,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 23:11:25,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 23:11:25,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 23:11:25,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 23:11:25,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 23:11:25,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 23:11:25,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 23:11:25,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 23:11:25,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 23:11:25,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 23:11:25,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 23:11:25,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 23:11:25,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 23:11:25,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 23:11:25,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 23:11:25,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 23:11:25,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 23:11:25,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 23:11:25,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 23:11:25,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 23:11:25,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 23:11:25,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 23:11:25,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 23:11:25,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 23:11:25,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 23:11:25,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 23:11:25,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 23:11:25,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 23:11:25,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 23:11:25,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 23:11:25,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 23:11:25,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 23:11:25,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 23:11:25,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 23:11:25,400 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 23:11:25,400 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 23:11:25,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 23:11:25,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 23:11:25,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 23:11:25,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 23:11:25,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 [2019-12-01 23:11:25,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 23:11:25,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 23:11:25,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 23:11:25,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 23:11:25,515 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 23:11:25,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2019-12-01 23:11:25,559 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/data/7c61b0c32/3755103821134a66b6e846ca19b8e4c3/FLAGc0b82f20d [2019-12-01 23:11:25,957 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 23:11:25,958 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2019-12-01 23:11:25,966 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/data/7c61b0c32/3755103821134a66b6e846ca19b8e4c3/FLAGc0b82f20d [2019-12-01 23:11:25,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/data/7c61b0c32/3755103821134a66b6e846ca19b8e4c3 [2019-12-01 23:11:25,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 23:11:25,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 23:11:25,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 23:11:25,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 23:11:25,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 23:11:25,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:11:25" (1/1) ... [2019-12-01 23:11:25,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bd7740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:25, skipping insertion in model container [2019-12-01 23:11:25,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:11:25" (1/1) ... [2019-12-01 23:11:25,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 23:11:26,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 23:11:26,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 23:11:26,268 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 23:11:26,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 23:11:26,332 INFO L208 MainTranslator]: Completed translation [2019-12-01 23:11:26,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26 WrapperNode [2019-12-01 23:11:26,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 23:11:26,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 23:11:26,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 23:11:26,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 23:11:26,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 23:11:26,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 23:11:26,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 23:11:26,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 23:11:26,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... [2019-12-01 23:11:26,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 23:11:26,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 23:11:26,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 23:11:26,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 23:11:26,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:11:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 23:11:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 23:11:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 23:11:27,569 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 23:11:27,569 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-01 23:11:27,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:11:27 BoogieIcfgContainer [2019-12-01 23:11:27,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 23:11:27,571 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 23:11:27,571 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 23:11:27,579 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 23:11:27,579 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:11:27" (1/1) ... [2019-12-01 23:11:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 23:11:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-12-01 23:11:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-12-01 23:11:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-01 23:11:27,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2019-12-01 23:11:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2019-12-01 23:11:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-01 23:11:28,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2019-12-01 23:11:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2019-12-01 23:11:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-01 23:11:28,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2019-12-01 23:11:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2019-12-01 23:11:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 23:11:28,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2019-12-01 23:11:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2019-12-01 23:11:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 23:11:28,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2019-12-01 23:11:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2019-12-01 23:11:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-01 23:11:28,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 23:11:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2019-12-01 23:11:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2019-12-01 23:11:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 23:11:29,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2019-12-01 23:11:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2019-12-01 23:11:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 23:11:29,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2019-12-01 23:11:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2019-12-01 23:11:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 23:11:29,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2019-12-01 23:11:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2019-12-01 23:11:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-01 23:11:30,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2019-12-01 23:11:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2019-12-01 23:11:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-01 23:11:30,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2019-12-01 23:11:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2019-12-01 23:11:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-01 23:11:30,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2019-12-01 23:11:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2019-12-01 23:11:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 23:11:30,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2019-12-01 23:11:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2019-12-01 23:11:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-01 23:11:30,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2019-12-01 23:11:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2019-12-01 23:11:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-01 23:11:31,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2019-12-01 23:11:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2019-12-01 23:11:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-01 23:11:31,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2019-12-01 23:11:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2019-12-01 23:11:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-01 23:11:31,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:11:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 223 states and 355 transitions. [2019-12-01 23:11:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2019-12-01 23:11:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-01 23:11:31,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:11:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2019-12-01 23:11:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2019-12-01 23:11:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-01 23:11:31,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2019-12-01 23:11:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2019-12-01 23:11:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-01 23:11:32,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 240 states and 380 transitions. [2019-12-01 23:11:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 380 transitions. [2019-12-01 23:11:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-01 23:11:32,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2019-12-01 23:11:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2019-12-01 23:11:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-01 23:11:32,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:11:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2019-12-01 23:11:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2019-12-01 23:11:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-01 23:11:32,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2019-12-01 23:11:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2019-12-01 23:11:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-01 23:11:33,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2019-12-01 23:11:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2019-12-01 23:11:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-01 23:11:34,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:11:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2019-12-01 23:11:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2019-12-01 23:11:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-01 23:11:34,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2019-12-01 23:11:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2019-12-01 23:11:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 23:11:34,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2019-12-01 23:11:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2019-12-01 23:11:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 23:11:34,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2019-12-01 23:11:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2019-12-01 23:11:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 23:11:35,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2019-12-01 23:11:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2019-12-01 23:11:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-01 23:11:36,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2019-12-01 23:11:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2019-12-01 23:11:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:37,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 362 states and 544 transitions. [2019-12-01 23:11:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-12-01 23:11:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:40,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 378 states and 565 transitions. [2019-12-01 23:11:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 565 transitions. [2019-12-01 23:11:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:42,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 380 states and 568 transitions. [2019-12-01 23:11:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 568 transitions. [2019-12-01 23:11:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:42,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 390 states and 579 transitions. [2019-12-01 23:11:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 579 transitions. [2019-12-01 23:11:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:43,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2019-12-01 23:11:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2019-12-01 23:11:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 23:11:43,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2019-12-01 23:11:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2019-12-01 23:11:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-01 23:11:43,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 407 states and 605 transitions. [2019-12-01 23:11:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 605 transitions. [2019-12-01 23:11:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-01 23:11:47,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 418 states and 617 transitions. [2019-12-01 23:11:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-12-01 23:11:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-01 23:11:48,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:11:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 429 states and 630 transitions. [2019-12-01 23:11:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2019-12-01 23:11:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-01 23:11:50,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:11:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 438 states and 641 transitions. [2019-12-01 23:11:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2019-12-01 23:11:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 23:11:51,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 466 states and 675 transitions. [2019-12-01 23:11:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 675 transitions. [2019-12-01 23:11:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 23:11:54,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 484 states and 704 transitions. [2019-12-01 23:11:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 704 transitions. [2019-12-01 23:11:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 23:11:56,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 492 states and 711 transitions. [2019-12-01 23:11:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 711 transitions. [2019-12-01 23:11:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 23:11:56,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 502 states and 721 transitions. [2019-12-01 23:11:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 721 transitions. [2019-12-01 23:11:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-01 23:11:57,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 503 states and 722 transitions. [2019-12-01 23:11:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 722 transitions. [2019-12-01 23:11:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-01 23:11:58,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 510 states and 729 transitions. [2019-12-01 23:11:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2019-12-01 23:11:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-01 23:11:58,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:11:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:11:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 511 states and 729 transitions. [2019-12-01 23:11:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 729 transitions. [2019-12-01 23:11:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-01 23:11:59,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:11:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:11:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 581 states and 814 transitions. [2019-12-01 23:12:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 814 transitions. [2019-12-01 23:12:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 23:12:00,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 591 states and 827 transitions. [2019-12-01 23:12:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 827 transitions. [2019-12-01 23:12:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 23:12:01,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 602 states and 837 transitions. [2019-12-01 23:12:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 837 transitions. [2019-12-01 23:12:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 23:12:01,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 611 states and 849 transitions. [2019-12-01 23:12:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 849 transitions. [2019-12-01 23:12:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-01 23:12:01,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 624 states and 864 transitions. [2019-12-01 23:12:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 864 transitions. [2019-12-01 23:12:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-01 23:12:02,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:12:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 626 states and 865 transitions. [2019-12-01 23:12:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 865 transitions. [2019-12-01 23:12:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-01 23:12:02,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 630 states and 868 transitions. [2019-12-01 23:12:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 868 transitions. [2019-12-01 23:12:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 23:12:02,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 632 states and 869 transitions. [2019-12-01 23:12:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 869 transitions. [2019-12-01 23:12:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 23:12:02,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 646 states and 885 transitions. [2019-12-01 23:12:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 885 transitions. [2019-12-01 23:12:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-01 23:12:03,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 648 states and 888 transitions. [2019-12-01 23:12:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 888 transitions. [2019-12-01 23:12:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-01 23:12:03,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 693 states and 937 transitions. [2019-12-01 23:12:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 937 transitions. [2019-12-01 23:12:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-01 23:12:07,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-01 23:12:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 789 states and 1041 transitions. [2019-12-01 23:12:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1041 transitions. [2019-12-01 23:12:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-01 23:12:09,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 802 states and 1061 transitions. [2019-12-01 23:12:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1061 transitions. [2019-12-01 23:12:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-01 23:12:10,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:12:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 815 states and 1095 transitions. [2019-12-01 23:12:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1095 transitions. [2019-12-01 23:12:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-01 23:12:11,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:12:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 820 states and 1105 transitions. [2019-12-01 23:12:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2019-12-01 23:12:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-01 23:12:12,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:12:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 825 states and 1112 transitions. [2019-12-01 23:12:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1112 transitions. [2019-12-01 23:12:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 23:12:12,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 833 states and 1122 transitions. [2019-12-01 23:12:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1122 transitions. [2019-12-01 23:12:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 23:12:14,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 838 states and 1126 transitions. [2019-12-01 23:12:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1126 transitions. [2019-12-01 23:12:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-01 23:12:14,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 23:12:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 843 states and 1136 transitions. [2019-12-01 23:12:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1136 transitions. [2019-12-01 23:12:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 23:12:14,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 883 states and 1187 transitions. [2019-12-01 23:12:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1187 transitions. [2019-12-01 23:12:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 23:12:19,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 899 states and 1202 transitions. [2019-12-01 23:12:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1202 transitions. [2019-12-01 23:12:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 23:12:22,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 903 states and 1206 transitions. [2019-12-01 23:12:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1206 transitions. [2019-12-01 23:12:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 23:12:22,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 23:12:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 912 states and 1228 transitions. [2019-12-01 23:12:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1228 transitions. [2019-12-01 23:12:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-01 23:12:24,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 23:12:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 937 states and 1258 transitions. [2019-12-01 23:12:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1258 transitions. [2019-12-01 23:12:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-01 23:12:28,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-01 23:12:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 951 states and 1281 transitions. [2019-12-01 23:12:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1281 transitions. [2019-12-01 23:12:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-01 23:12:30,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 968 states and 1298 transitions. [2019-12-01 23:12:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1298 transitions. [2019-12-01 23:12:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-01 23:12:30,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 998 states and 1332 transitions. [2019-12-01 23:12:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1332 transitions. [2019-12-01 23:12:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-01 23:12:33,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1023 states and 1359 transitions. [2019-12-01 23:12:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1359 transitions. [2019-12-01 23:12:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-01 23:12:37,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1080 states and 1420 transitions. [2019-12-01 23:12:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1420 transitions. [2019-12-01 23:12:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-01 23:12:49,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-01 23:12:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1084 states and 1425 transitions. [2019-12-01 23:12:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1425 transitions. [2019-12-01 23:12:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-01 23:12:50,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1122 states and 1475 transitions. [2019-12-01 23:12:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1475 transitions. [2019-12-01 23:12:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-01 23:12:53,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1153 states and 1505 transitions. [2019-12-01 23:12:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1505 transitions. [2019-12-01 23:12:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-01 23:12:54,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:12:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1170 states and 1523 transitions. [2019-12-01 23:12:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1523 transitions. [2019-12-01 23:12:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 23:12:54,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-01 23:12:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1171 states and 1523 transitions. [2019-12-01 23:12:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1523 transitions. [2019-12-01 23:12:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-01 23:12:54,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1212 states and 1566 transitions. [2019-12-01 23:12:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1566 transitions. [2019-12-01 23:12:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 23:12:56,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:12:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1223 states and 1578 transitions. [2019-12-01 23:12:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1578 transitions. [2019-12-01 23:12:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-01 23:12:56,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-01 23:12:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:12:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1236 states and 1597 transitions. [2019-12-01 23:12:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1597 transitions. [2019-12-01 23:12:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-01 23:12:59,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:12:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:12:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 23:13:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1262 states and 1632 transitions. [2019-12-01 23:13:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1632 transitions. [2019-12-01 23:13:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-01 23:13:00,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1282 states and 1654 transitions. [2019-12-01 23:13:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1654 transitions. [2019-12-01 23:13:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 23:13:04,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 23:13:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1284 states and 1660 transitions. [2019-12-01 23:13:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1660 transitions. [2019-12-01 23:13:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 23:13:04,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 23:13:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1288 states and 1664 transitions. [2019-12-01 23:13:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1664 transitions. [2019-12-01 23:13:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 23:13:05,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 23:13:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1289 states and 1665 transitions. [2019-12-01 23:13:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1665 transitions. [2019-12-01 23:13:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 23:13:05,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 23:13:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1293 states and 1669 transitions. [2019-12-01 23:13:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1669 transitions. [2019-12-01 23:13:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-01 23:13:05,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-01 23:13:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1310 states and 1690 transitions. [2019-12-01 23:13:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1690 transitions. [2019-12-01 23:13:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 23:13:08,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-01 23:13:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1314 states and 1696 transitions. [2019-12-01 23:13:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1696 transitions. [2019-12-01 23:13:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 23:13:09,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-01 23:13:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1323 states and 1706 transitions. [2019-12-01 23:13:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1706 transitions. [2019-12-01 23:13:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-01 23:13:09,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 23:13:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1327 states and 1717 transitions. [2019-12-01 23:13:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1717 transitions. [2019-12-01 23:13:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-01 23:13:12,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1357 states and 1754 transitions. [2019-12-01 23:13:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1754 transitions. [2019-12-01 23:13:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:19,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1393 states and 1798 transitions. [2019-12-01 23:13:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1798 transitions. [2019-12-01 23:13:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:23,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1397 states and 1806 transitions. [2019-12-01 23:13:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1806 transitions. [2019-12-01 23:13:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:25,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1402 states and 1812 transitions. [2019-12-01 23:13:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1812 transitions. [2019-12-01 23:13:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:25,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1408 states and 1822 transitions. [2019-12-01 23:13:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1822 transitions. [2019-12-01 23:13:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:27,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1409 states and 1822 transitions. [2019-12-01 23:13:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1822 transitions. [2019-12-01 23:13:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:27,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-01 23:13:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1410 states and 1822 transitions. [2019-12-01 23:13:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1822 transitions. [2019-12-01 23:13:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:28,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1413 states and 1829 transitions. [2019-12-01 23:13:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1829 transitions. [2019-12-01 23:13:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:29,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1417 states and 1834 transitions. [2019-12-01 23:13:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1834 transitions. [2019-12-01 23:13:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 23:13:30,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1418 states and 1834 transitions. [2019-12-01 23:13:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1834 transitions. [2019-12-01 23:13:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:31,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-01 23:13:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1430 states and 1847 transitions. [2019-12-01 23:13:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1847 transitions. [2019-12-01 23:13:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:33,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-01 23:13:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1431 states and 1847 transitions. [2019-12-01 23:13:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1847 transitions. [2019-12-01 23:13:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:33,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1436 states and 1855 transitions. [2019-12-01 23:13:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1855 transitions. [2019-12-01 23:13:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:34,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1440 states and 1859 transitions. [2019-12-01 23:13:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1859 transitions. [2019-12-01 23:13:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:36,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-01 23:13:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1444 states and 1863 transitions. [2019-12-01 23:13:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1863 transitions. [2019-12-01 23:13:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 23:13:38,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1474 states and 1899 transitions. [2019-12-01 23:13:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1899 transitions. [2019-12-01 23:13:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 23:13:40,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1515 states and 1943 transitions. [2019-12-01 23:13:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1943 transitions. [2019-12-01 23:13:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 23:13:47,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1525 states and 1960 transitions. [2019-12-01 23:13:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1960 transitions. [2019-12-01 23:13:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 23:13:53,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:13:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:13:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1530 states and 1965 transitions. [2019-12-01 23:13:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1965 transitions. [2019-12-01 23:13:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:13:55,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:13:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:13:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 23:14:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1606 states and 2048 transitions. [2019-12-01 23:14:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2048 transitions. [2019-12-01 23:14:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:14:01,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 23:14:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1630 states and 2078 transitions. [2019-12-01 23:14:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2078 transitions. [2019-12-01 23:14:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:14:09,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 23:14:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1634 states and 2087 transitions. [2019-12-01 23:14:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2087 transitions. [2019-12-01 23:14:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:14:12,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 23:14:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1639 states and 2092 transitions. [2019-12-01 23:14:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2092 transitions. [2019-12-01 23:14:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:14:13,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 23:14:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1646 states and 2100 transitions. [2019-12-01 23:14:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2100 transitions. [2019-12-01 23:14:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 23:14:16,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-01 23:14:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 1650 states and 2105 transitions. [2019-12-01 23:14:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2105 transitions. [2019-12-01 23:14:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-01 23:14:17,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 23:14:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1654 states and 2114 transitions. [2019-12-01 23:14:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2114 transitions. [2019-12-01 23:14:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-01 23:14:18,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:14:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1694 states and 2157 transitions. [2019-12-01 23:14:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2157 transitions. [2019-12-01 23:14:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 23:14:26,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-01 23:14:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 1765 states and 2228 transitions. [2019-12-01 23:14:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2228 transitions. [2019-12-01 23:14:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 23:14:29,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 23:14:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1813 states and 2276 transitions. [2019-12-01 23:14:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2276 transitions. [2019-12-01 23:14:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-01 23:14:41,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 23:14:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:14:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1832 states and 2298 transitions. [2019-12-01 23:14:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2298 transitions. [2019-12-01 23:14:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-01 23:14:49,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:14:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:14:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:15:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1896 states and 2365 transitions. [2019-12-01 23:15:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2365 transitions. [2019-12-01 23:15:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 23:15:04,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-01 23:15:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 1966 states and 2441 transitions. [2019-12-01 23:15:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2441 transitions. [2019-12-01 23:15:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:15:06,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-01 23:15:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2037 states and 2524 transitions. [2019-12-01 23:15:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2524 transitions. [2019-12-01 23:15:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:15:20,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-01 23:15:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2057 states and 2548 transitions. [2019-12-01 23:15:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2548 transitions. [2019-12-01 23:15:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:15:24,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-01 23:15:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2077 states and 2568 transitions. [2019-12-01 23:15:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2568 transitions. [2019-12-01 23:15:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:15:26,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-01 23:15:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2097 states and 2588 transitions. [2019-12-01 23:15:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2588 transitions. [2019-12-01 23:15:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 23:15:27,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-01 23:15:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2098 states and 2588 transitions. [2019-12-01 23:15:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2588 transitions. [2019-12-01 23:15:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-01 23:15:28,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-01 23:15:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2123 states and 2615 transitions. [2019-12-01 23:15:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2615 transitions. [2019-12-01 23:15:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-01 23:15:40,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 23:15:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2151 states and 2644 transitions. [2019-12-01 23:15:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2644 transitions. [2019-12-01 23:15:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-01 23:15:55,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:15:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 23:15:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:15:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2157 states and 2648 transitions. [2019-12-01 23:15:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2648 transitions. [2019-12-01 23:15:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 23:15:59,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:15:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 23:16:08,401 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 23:16:09,572 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 23:16:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2209 states and 2702 transitions. [2019-12-01 23:16:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2702 transitions. [2019-12-01 23:16:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-01 23:16:13,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 23:16:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2215 states and 2706 transitions. [2019-12-01 23:16:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2706 transitions. [2019-12-01 23:16:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-01 23:16:15,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 23:16:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2222 states and 2714 transitions. [2019-12-01 23:16:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2714 transitions. [2019-12-01 23:16:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-01 23:16:15,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 178 proven. 4 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-12-01 23:16:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2227 states and 2720 transitions. [2019-12-01 23:16:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2720 transitions. [2019-12-01 23:16:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-12-01 23:16:16,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-01 23:16:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2231 states and 2727 transitions. [2019-12-01 23:16:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2727 transitions. [2019-12-01 23:16:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-12-01 23:16:17,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-01 23:16:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2234 states and 2728 transitions. [2019-12-01 23:16:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2728 transitions. [2019-12-01 23:16:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-12-01 23:16:18,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-01 23:16:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2235 states and 2728 transitions. [2019-12-01 23:16:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2728 transitions. [2019-12-01 23:16:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-12-01 23:16:18,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-01 23:16:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2236 states and 2728 transitions. [2019-12-01 23:16:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2728 transitions. [2019-12-01 23:16:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-01 23:16:18,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-01 23:16:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2240 states and 2734 transitions. [2019-12-01 23:16:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2734 transitions. [2019-12-01 23:16:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-01 23:16:19,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-01 23:16:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2241 states and 2738 transitions. [2019-12-01 23:16:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2738 transitions. [2019-12-01 23:16:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 23:16:19,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 23:16:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 338 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 23:16:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 23:16:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2223 states and 2719 transitions. [2019-12-01 23:16:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2719 transitions. [2019-12-01 23:16:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-01 23:16:28,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 23:16:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:16:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:16:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:16:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 23:16:29,178 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 146 iterations. [2019-12-01 23:16:29,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 11:16:29 ImpRootNode [2019-12-01 23:16:29,335 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 23:16:29,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 23:16:29,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 23:16:29,335 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 23:16:29,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:11:27" (3/4) ... [2019-12-01 23:16:29,337 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 23:16:29,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_285c9588-9dad-4df0-97e7-b06c8004231e/bin/ukojak/witness.graphml [2019-12-01 23:16:29,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 23:16:29,444 INFO L168 Benchmark]: Toolchain (without parser) took 303466.04 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 634.9 MB). Free memory was 939.3 MB in the beginning and 903.1 MB in the end (delta: 36.2 MB). Peak memory consumption was 671.1 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,444 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 23:16:29,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.69 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,445 INFO L168 Benchmark]: Boogie Preprocessor took 38.56 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: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,445 INFO L168 Benchmark]: RCFGBuilder took 1143.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 848.2 MB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,446 INFO L168 Benchmark]: CodeCheck took 301763.78 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 848.2 MB in the beginning and 938.2 MB in the end (delta: -90.0 MB). Peak memory consumption was 444.8 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,446 INFO L168 Benchmark]: Witness Printer took 108.17 ms. Allocated memory is still 1.7 GB. Free memory was 938.2 MB in the beginning and 903.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2019-12-01 23:16:29,447 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 301.5s, OverallIterations: 146, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 451940880 SDtfs, -628274828 SDslu, 559963232 SDs, 0 SdLazy, 1745412818 SolverSat, -620088370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 697.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145145 GetRequests, 140284 SyntacticMatches, 3263 SemanticMatches, 1598 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1913908 ImplicationChecksByTransitivity, 275.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 20878 NumberOfCodeBlocks, 20878 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 20470 ConstructedInterpolants, 0 QuantifiedInterpolants, 15202649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 145 InterpolantComputations, 121 PerfectInterpolantSequences, 14805/15229 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.69 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.56 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: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1143.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 848.2 MB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. * CodeCheck took 301763.78 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 848.2 MB in the beginning and 938.2 MB in the end (delta: -90.0 MB). Peak memory consumption was 444.8 MB. Max. memory is 11.5 GB. * Witness Printer took 108.17 ms. Allocated memory is still 1.7 GB. Free memory was 938.2 MB in the beginning and 903.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...