./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 19:51:57,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:51:57,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:51:57,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:51:57,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:51:57,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:51:57,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:51:57,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:51:57,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:51:57,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:51:57,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:51:57,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:51:57,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:51:57,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:51:57,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:51:57,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:51:57,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:51:57,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:51:57,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:51:57,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:51:57,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:51:57,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:51:57,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:51:57,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:51:57,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:51:57,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:51:57,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:51:57,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:51:57,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:51:57,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:51:57,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:51:57,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:51:57,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:51:57,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:51:57,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:51:57,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:51:57,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 19:51:57,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:51:57,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:51:57,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:51:57,686 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 19:51:57,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 19:51:57,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 19:51:57,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:51:57,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:51:57,688 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 19:51:57,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:51:57,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 19:51:57,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:51:57,689 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2018-12-08 19:51:57,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:51:57,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:51:57,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:51:57,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:51:57,720 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:51:57,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-12-08 19:51:57,760 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/data/059209205/dc469b26cef94a969770bfc89d00ab04/FLAG247830358 [2018-12-08 19:51:58,220 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:51:58,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-12-08 19:51:58,227 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/data/059209205/dc469b26cef94a969770bfc89d00ab04/FLAG247830358 [2018-12-08 19:51:58,236 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/data/059209205/dc469b26cef94a969770bfc89d00ab04 [2018-12-08 19:51:58,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:51:58,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:51:58,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:51:58,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:51:58,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:51:58,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58, skipping insertion in model container [2018-12-08 19:51:58,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:51:58,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:51:58,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:51:58,460 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:51:58,555 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:51:58,565 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:51:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58 WrapperNode [2018-12-08 19:51:58,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:51:58,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:51:58,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:51:58,566 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:51:58,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:51:58,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:51:58,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:51:58,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:51:58,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... [2018-12-08 19:51:58,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:51:58,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:51:58,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:51:58,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:51:58,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:51:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 19:51:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:51:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:51:59,600 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:51:59,600 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 19:51:59,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:51:59 BoogieIcfgContainer [2018-12-08 19:51:59,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:51:59,602 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 19:51:59,602 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 19:51:59,611 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 19:51:59,611 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:51:59" (1/1) ... [2018-12-08 19:51:59,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:51:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:51:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-08 19:51:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-08 19:51:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 19:51:59,652 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:51:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:51:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2018-12-08 19:52:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2018-12-08 19:52:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 19:52:00,144 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2018-12-08 19:52:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2018-12-08 19:52:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 19:52:00,324 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2018-12-08 19:52:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2018-12-08 19:52:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 19:52:00,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2018-12-08 19:52:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2018-12-08 19:52:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 19:52:00,512 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2018-12-08 19:52:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2018-12-08 19:52:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 19:52:00,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2018-12-08 19:52:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2018-12-08 19:52:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 19:52:01,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2018-12-08 19:52:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2018-12-08 19:52:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 19:52:01,289 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2018-12-08 19:52:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2018-12-08 19:52:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:52:01,359 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2018-12-08 19:52:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2018-12-08 19:52:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 19:52:01,791 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 19:52:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2018-12-08 19:52:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2018-12-08 19:52:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 19:52:01,962 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2018-12-08 19:52:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2018-12-08 19:52:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 19:52:02,152 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2018-12-08 19:52:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2018-12-08 19:52:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 19:52:02,195 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 258 states and 385 transitions. [2018-12-08 19:52:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2018-12-08 19:52:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 19:52:02,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2018-12-08 19:52:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2018-12-08 19:52:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 19:52:02,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2018-12-08 19:52:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2018-12-08 19:52:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 19:52:02,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2018-12-08 19:52:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2018-12-08 19:52:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 19:52:03,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2018-12-08 19:52:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2018-12-08 19:52:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 19:52:03,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2018-12-08 19:52:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2018-12-08 19:52:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 19:52:03,412 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2018-12-08 19:52:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2018-12-08 19:52:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 19:52:03,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 296 states and 435 transitions. [2018-12-08 19:52:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 435 transitions. [2018-12-08 19:52:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 19:52:03,931 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2018-12-08 19:52:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2018-12-08 19:52:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 19:52:04,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2018-12-08 19:52:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2018-12-08 19:52:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 19:52:04,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2018-12-08 19:52:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2018-12-08 19:52:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 19:52:05,063 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:52:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2018-12-08 19:52:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2018-12-08 19:52:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 19:52:05,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2018-12-08 19:52:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2018-12-08 19:52:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 19:52:05,332 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2018-12-08 19:52:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2018-12-08 19:52:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 19:52:05,418 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:52:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2018-12-08 19:52:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2018-12-08 19:52:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 19:52:05,528 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:52:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2018-12-08 19:52:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2018-12-08 19:52:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 19:52:05,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2018-12-08 19:52:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2018-12-08 19:52:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:52:05,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2018-12-08 19:52:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2018-12-08 19:52:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:52:05,931 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2018-12-08 19:52:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2018-12-08 19:52:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:52:07,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2018-12-08 19:52:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2018-12-08 19:52:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:52:08,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2018-12-08 19:52:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2018-12-08 19:52:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:52:08,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2018-12-08 19:52:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2018-12-08 19:52:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:52:09,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2018-12-08 19:52:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2018-12-08 19:52:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:52:09,178 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:52:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2018-12-08 19:52:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2018-12-08 19:52:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:52:09,213 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:52:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2018-12-08 19:52:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2018-12-08 19:52:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:52:09,299 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2018-12-08 19:52:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2018-12-08 19:52:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:52:09,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2018-12-08 19:52:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2018-12-08 19:52:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:52:09,983 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2018-12-08 19:52:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2018-12-08 19:52:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:52:10,436 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 480 states and 673 transitions. [2018-12-08 19:52:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 673 transitions. [2018-12-08 19:52:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:52:12,270 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 490 states and 683 transitions. [2018-12-08 19:52:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 683 transitions. [2018-12-08 19:52:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:52:12,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 497 states and 690 transitions. [2018-12-08 19:52:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 690 transitions. [2018-12-08 19:52:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:52:12,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 504 states and 697 transitions. [2018-12-08 19:52:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 697 transitions. [2018-12-08 19:52:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 19:52:12,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 506 states and 701 transitions. [2018-12-08 19:52:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 701 transitions. [2018-12-08 19:52:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 19:52:13,078 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 508 states and 703 transitions. [2018-12-08 19:52:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 703 transitions. [2018-12-08 19:52:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 19:52:13,107 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:52:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 512 states and 709 transitions. [2018-12-08 19:52:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 709 transitions. [2018-12-08 19:52:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 19:52:13,557 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 542 states and 747 transitions. [2018-12-08 19:52:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 747 transitions. [2018-12-08 19:52:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 19:52:16,214 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 556 states and 768 transitions. [2018-12-08 19:52:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 768 transitions. [2018-12-08 19:52:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 19:52:16,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 562 states and 776 transitions. [2018-12-08 19:52:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 776 transitions. [2018-12-08 19:52:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 19:52:17,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 569 states and 783 transitions. [2018-12-08 19:52:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 783 transitions. [2018-12-08 19:52:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 19:52:17,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 574 states and 789 transitions. [2018-12-08 19:52:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 789 transitions. [2018-12-08 19:52:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 19:52:18,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 594 states and 817 transitions. [2018-12-08 19:52:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 817 transitions. [2018-12-08 19:52:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 19:52:20,898 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 605 states and 827 transitions. [2018-12-08 19:52:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 827 transitions. [2018-12-08 19:52:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 19:52:22,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 619 states and 843 transitions. [2018-12-08 19:52:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 843 transitions. [2018-12-08 19:52:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 19:52:22,870 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 623 states and 849 transitions. [2018-12-08 19:52:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 849 transitions. [2018-12-08 19:52:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:52:22,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 628 states and 858 transitions. [2018-12-08 19:52:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 858 transitions. [2018-12-08 19:52:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 19:52:23,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 631 states and 861 transitions. [2018-12-08 19:52:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 861 transitions. [2018-12-08 19:52:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:52:23,954 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 637 states and 870 transitions. [2018-12-08 19:52:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 870 transitions. [2018-12-08 19:52:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:52:24,454 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 638 states and 872 transitions. [2018-12-08 19:52:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 872 transitions. [2018-12-08 19:52:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:52:24,708 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 639 states and 874 transitions. [2018-12-08 19:52:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 874 transitions. [2018-12-08 19:52:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:52:24,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 640 states and 875 transitions. [2018-12-08 19:52:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 875 transitions. [2018-12-08 19:52:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 19:52:25,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 646 states and 883 transitions. [2018-12-08 19:52:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 883 transitions. [2018-12-08 19:52:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 19:52:25,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:52:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 655 states and 891 transitions. [2018-12-08 19:52:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 891 transitions. [2018-12-08 19:52:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:52:26,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 680 states and 932 transitions. [2018-12-08 19:52:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 932 transitions. [2018-12-08 19:52:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 19:52:28,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 692 states and 952 transitions. [2018-12-08 19:52:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 952 transitions. [2018-12-08 19:52:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 19:52:32,001 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 717 states and 978 transitions. [2018-12-08 19:52:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 978 transitions. [2018-12-08 19:52:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 19:52:32,704 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 728 states and 994 transitions. [2018-12-08 19:52:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 994 transitions. [2018-12-08 19:52:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 19:52:33,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 733 states and 999 transitions. [2018-12-08 19:52:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 999 transitions. [2018-12-08 19:52:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 19:52:33,738 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 735 states and 1002 transitions. [2018-12-08 19:52:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1002 transitions. [2018-12-08 19:52:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 19:52:34,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 737 states and 1003 transitions. [2018-12-08 19:52:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1003 transitions. [2018-12-08 19:52:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 19:52:34,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 738 states and 1004 transitions. [2018-12-08 19:52:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1004 transitions. [2018-12-08 19:52:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 19:52:34,611 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 740 states and 1005 transitions. [2018-12-08 19:52:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1005 transitions. [2018-12-08 19:52:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 19:52:34,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 750 states and 1016 transitions. [2018-12-08 19:52:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1016 transitions. [2018-12-08 19:52:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 19:52:34,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 751 states and 1017 transitions. [2018-12-08 19:52:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1017 transitions. [2018-12-08 19:52:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 19:52:34,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 764 states and 1039 transitions. [2018-12-08 19:52:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1039 transitions. [2018-12-08 19:52:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 19:52:35,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 806 states and 1083 transitions. [2018-12-08 19:52:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1083 transitions. [2018-12-08 19:52:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 19:52:39,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 816 states and 1103 transitions. [2018-12-08 19:52:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1103 transitions. [2018-12-08 19:52:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 19:52:41,675 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 817 states and 1103 transitions. [2018-12-08 19:52:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1103 transitions. [2018-12-08 19:52:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 19:52:41,869 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 818 states and 1104 transitions. [2018-12-08 19:52:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1104 transitions. [2018-12-08 19:52:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 19:52:42,155 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 828 states and 1116 transitions. [2018-12-08 19:52:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1116 transitions. [2018-12-08 19:52:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 19:52:42,982 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:52:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 830 states and 1118 transitions. [2018-12-08 19:52:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1118 transitions. [2018-12-08 19:52:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 19:52:43,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 844 states and 1140 transitions. [2018-12-08 19:52:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1140 transitions. [2018-12-08 19:52:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 19:52:45,103 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 847 states and 1144 transitions. [2018-12-08 19:52:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1144 transitions. [2018-12-08 19:52:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 19:52:45,640 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 849 states and 1146 transitions. [2018-12-08 19:52:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1146 transitions. [2018-12-08 19:52:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 19:52:46,379 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:52:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 854 states and 1152 transitions. [2018-12-08 19:52:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1152 transitions. [2018-12-08 19:52:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:46,680 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:52:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 856 states and 1155 transitions. [2018-12-08 19:52:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1155 transitions. [2018-12-08 19:52:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:46,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:52:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 857 states and 1156 transitions. [2018-12-08 19:52:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1156 transitions. [2018-12-08 19:52:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:46,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 895 states and 1201 transitions. [2018-12-08 19:52:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1201 transitions. [2018-12-08 19:52:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:52,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 906 states and 1211 transitions. [2018-12-08 19:52:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1211 transitions. [2018-12-08 19:52:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:53,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 950 states and 1257 transitions. [2018-12-08 19:52:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1257 transitions. [2018-12-08 19:52:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:53,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 952 states and 1259 transitions. [2018-12-08 19:52:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1259 transitions. [2018-12-08 19:52:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:54,213 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 953 states and 1259 transitions. [2018-12-08 19:52:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1259 transitions. [2018-12-08 19:52:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:54,303 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 954 states and 1259 transitions. [2018-12-08 19:52:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1259 transitions. [2018-12-08 19:52:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:54,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:52:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 955 states and 1259 transitions. [2018-12-08 19:52:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1259 transitions. [2018-12-08 19:52:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 19:52:54,651 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:52:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:52:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 956 states and 1260 transitions. [2018-12-08 19:52:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1260 transitions. [2018-12-08 19:52:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 19:52:54,985 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:52:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:52:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:52:57,208 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-12-08 19:52:59,332 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-08 19:53:01,148 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-08 19:53:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 975 states and 1290 transitions. [2018-12-08 19:53:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1290 transitions. [2018-12-08 19:53:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 19:53:05,093 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:53:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 977 states and 1293 transitions. [2018-12-08 19:53:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1293 transitions. [2018-12-08 19:53:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 19:53:05,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:53:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 990 states and 1314 transitions. [2018-12-08 19:53:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1314 transitions. [2018-12-08 19:53:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 19:53:06,883 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:53:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 992 states and 1317 transitions. [2018-12-08 19:53:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1317 transitions. [2018-12-08 19:53:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 19:53:07,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:53:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 993 states and 1317 transitions. [2018-12-08 19:53:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1317 transitions. [2018-12-08 19:53:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 19:53:07,382 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 19:53:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1073 states and 1408 transitions. [2018-12-08 19:53:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1408 transitions. [2018-12-08 19:53:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:08,913 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1087 states and 1424 transitions. [2018-12-08 19:53:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1424 transitions. [2018-12-08 19:53:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:09,673 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1088 states and 1425 transitions. [2018-12-08 19:53:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1425 transitions. [2018-12-08 19:53:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:09,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1090 states and 1426 transitions. [2018-12-08 19:53:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1426 transitions. [2018-12-08 19:53:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:09,946 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1092 states and 1427 transitions. [2018-12-08 19:53:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1427 transitions. [2018-12-08 19:53:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:10,170 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1099 states and 1434 transitions. [2018-12-08 19:53:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1434 transitions. [2018-12-08 19:53:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:10,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 19:53:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1101 states and 1435 transitions. [2018-12-08 19:53:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1435 transitions. [2018-12-08 19:53:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 19:53:10,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 19:53:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1102 states and 1435 transitions. [2018-12-08 19:53:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1435 transitions. [2018-12-08 19:53:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 19:53:10,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:53:14,051 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-12-08 19:53:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1120 states and 1464 transitions. [2018-12-08 19:53:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1464 transitions. [2018-12-08 19:53:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 19:53:18,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1121 states and 1466 transitions. [2018-12-08 19:53:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1466 transitions. [2018-12-08 19:53:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 19:53:19,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1122 states and 1467 transitions. [2018-12-08 19:53:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1467 transitions. [2018-12-08 19:53:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 19:53:19,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:23,601 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-08 19:53:25,661 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-12-08 19:53:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1189 states and 1539 transitions. [2018-12-08 19:53:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1539 transitions. [2018-12-08 19:53:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 19:53:28,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 19:53:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1209 states and 1566 transitions. [2018-12-08 19:53:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1566 transitions. [2018-12-08 19:53:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 19:53:29,785 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:53:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1248 states and 1607 transitions. [2018-12-08 19:53:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1607 transitions. [2018-12-08 19:53:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 19:53:30,878 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:53:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1250 states and 1608 transitions. [2018-12-08 19:53:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1608 transitions. [2018-12-08 19:53:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 19:53:31,137 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 19:53:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1255 states and 1617 transitions. [2018-12-08 19:53:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1617 transitions. [2018-12-08 19:53:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:31,509 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-08 19:53:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1280 states and 1647 transitions. [2018-12-08 19:53:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1647 transitions. [2018-12-08 19:53:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:33,663 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:53:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1291 states and 1659 transitions. [2018-12-08 19:53:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1659 transitions. [2018-12-08 19:53:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:33,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:53:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1302 states and 1674 transitions. [2018-12-08 19:53:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1674 transitions. [2018-12-08 19:53:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:34,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:53:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1317 states and 1691 transitions. [2018-12-08 19:53:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1691 transitions. [2018-12-08 19:53:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:35,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1346 states and 1728 transitions. [2018-12-08 19:53:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1728 transitions. [2018-12-08 19:53:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 19:53:38,890 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:40,394 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-08 19:53:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1356 states and 1737 transitions. [2018-12-08 19:53:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1737 transitions. [2018-12-08 19:53:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 19:53:41,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:53:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1357 states and 1738 transitions. [2018-12-08 19:53:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1738 transitions. [2018-12-08 19:53:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 19:53:41,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 19:53:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1358 states and 1740 transitions. [2018-12-08 19:53:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1740 transitions. [2018-12-08 19:53:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 19:53:41,301 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1368 states and 1758 transitions. [2018-12-08 19:53:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1758 transitions. [2018-12-08 19:53:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 19:53:44,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 19:53:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1372 states and 1762 transitions. [2018-12-08 19:53:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1762 transitions. [2018-12-08 19:53:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 19:53:45,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1389 states and 1784 transitions. [2018-12-08 19:53:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1784 transitions. [2018-12-08 19:53:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 19:53:48,824 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1395 states and 1791 transitions. [2018-12-08 19:53:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1791 transitions. [2018-12-08 19:53:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 19:53:49,870 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:53:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1460 states and 1855 transitions. [2018-12-08 19:53:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1855 transitions. [2018-12-08 19:53:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 19:53:50,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 19:53:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1465 states and 1863 transitions. [2018-12-08 19:53:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1863 transitions. [2018-12-08 19:53:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 19:53:51,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 19:53:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1466 states and 1866 transitions. [2018-12-08 19:53:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1866 transitions. [2018-12-08 19:53:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 19:53:52,120 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:53:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1473 states and 1877 transitions. [2018-12-08 19:53:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1877 transitions. [2018-12-08 19:53:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 19:53:52,484 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:53:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1475 states and 1880 transitions. [2018-12-08 19:53:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1880 transitions. [2018-12-08 19:53:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 19:53:52,931 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 19:53:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1477 states and 1882 transitions. [2018-12-08 19:53:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1882 transitions. [2018-12-08 19:53:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 19:53:53,633 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:53:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1499 states and 1908 transitions. [2018-12-08 19:53:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1908 transitions. [2018-12-08 19:53:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 19:53:58,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 19:53:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1507 states and 1916 transitions. [2018-12-08 19:53:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1916 transitions. [2018-12-08 19:53:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 19:53:58,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 19:53:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:53:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1509 states and 1918 transitions. [2018-12-08 19:53:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1918 transitions. [2018-12-08 19:53:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 19:53:59,422 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:53:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:53:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1519 states and 1936 transitions. [2018-12-08 19:54:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1936 transitions. [2018-12-08 19:54:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 19:54:03,065 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1523 states and 1943 transitions. [2018-12-08 19:54:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1943 transitions. [2018-12-08 19:54:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 19:54:04,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1524 states and 1945 transitions. [2018-12-08 19:54:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1945 transitions. [2018-12-08 19:54:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 19:54:06,209 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1533 states and 1956 transitions. [2018-12-08 19:54:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1956 transitions. [2018-12-08 19:54:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 19:54:08,053 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1545 states and 1970 transitions. [2018-12-08 19:54:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1970 transitions. [2018-12-08 19:54:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 19:54:10,604 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 1591 states and 2026 transitions. [2018-12-08 19:54:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2026 transitions. [2018-12-08 19:54:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 19:54:23,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 19:54:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1621 states and 2056 transitions. [2018-12-08 19:54:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2056 transitions. [2018-12-08 19:54:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:24,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 19:54:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1628 states and 2068 transitions. [2018-12-08 19:54:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2068 transitions. [2018-12-08 19:54:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:27,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1634 states and 2076 transitions. [2018-12-08 19:54:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2076 transitions. [2018-12-08 19:54:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:27,813 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1636 states and 2080 transitions. [2018-12-08 19:54:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2080 transitions. [2018-12-08 19:54:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:28,735 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1638 states and 2084 transitions. [2018-12-08 19:54:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2084 transitions. [2018-12-08 19:54:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:29,679 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1644 states and 2090 transitions. [2018-12-08 19:54:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2090 transitions. [2018-12-08 19:54:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 19:54:30,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:54:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 1650 states and 2096 transitions. [2018-12-08 19:54:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2096 transitions. [2018-12-08 19:54:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 19:54:31,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 19:54:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 1655 states and 2104 transitions. [2018-12-08 19:54:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2104 transitions. [2018-12-08 19:54:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 19:54:31,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 19:54:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1660 states and 2108 transitions. [2018-12-08 19:54:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2108 transitions. [2018-12-08 19:54:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 19:54:32,239 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 19:54:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1665 states and 2115 transitions. [2018-12-08 19:54:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2115 transitions. [2018-12-08 19:54:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 19:54:32,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:54:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 1670 states and 2123 transitions. [2018-12-08 19:54:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2123 transitions. [2018-12-08 19:54:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 19:54:33,926 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 19:54:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1675 states and 2137 transitions. [2018-12-08 19:54:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2137 transitions. [2018-12-08 19:54:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 19:54:36,778 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 1689 states and 2153 transitions. [2018-12-08 19:54:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2153 transitions. [2018-12-08 19:54:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 19:54:39,168 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 1691 states and 2153 transitions. [2018-12-08 19:54:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2153 transitions. [2018-12-08 19:54:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 19:54:41,702 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-08 19:54:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1696 states and 2162 transitions. [2018-12-08 19:54:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2162 transitions. [2018-12-08 19:54:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 19:54:44,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 19:54:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1715 states and 2182 transitions. [2018-12-08 19:54:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2182 transitions. [2018-12-08 19:54:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 19:54:44,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1724 states and 2191 transitions. [2018-12-08 19:54:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2191 transitions. [2018-12-08 19:54:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 19:54:45,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1726 states and 2192 transitions. [2018-12-08 19:54:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2192 transitions. [2018-12-08 19:54:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 19:54:45,669 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1728 states and 2193 transitions. [2018-12-08 19:54:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2193 transitions. [2018-12-08 19:54:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 19:54:46,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1736 states and 2202 transitions. [2018-12-08 19:54:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2202 transitions. [2018-12-08 19:54:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 19:54:49,063 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 1738 states and 2204 transitions. [2018-12-08 19:54:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2204 transitions. [2018-12-08 19:54:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 19:54:49,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:51,761 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-08 19:54:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1749 states and 2218 transitions. [2018-12-08 19:54:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2218 transitions. [2018-12-08 19:54:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 19:54:54,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1756 states and 2224 transitions. [2018-12-08 19:54:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2224 transitions. [2018-12-08 19:54:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 19:54:55,982 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:54:58,134 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-08 19:54:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:54:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1766 states and 2233 transitions. [2018-12-08 19:54:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2233 transitions. [2018-12-08 19:54:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 19:54:58,547 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:54:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:54:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 19:55:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1789 states and 2257 transitions. [2018-12-08 19:55:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2257 transitions. [2018-12-08 19:55:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 19:55:00,436 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 19:55:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 1859 states and 2331 transitions. [2018-12-08 19:55:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2331 transitions. [2018-12-08 19:55:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 19:55:02,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-08 19:55:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 1869 states and 2343 transitions. [2018-12-08 19:55:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2343 transitions. [2018-12-08 19:55:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 19:55:03,585 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 19:55:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 1871 states and 2344 transitions. [2018-12-08 19:55:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2344 transitions. [2018-12-08 19:55:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:03,986 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 19:55:06,540 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-08 19:55:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 1916 states and 2391 transitions. [2018-12-08 19:55:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2391 transitions. [2018-12-08 19:55:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:12,019 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 19:55:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 1919 states and 2395 transitions. [2018-12-08 19:55:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2395 transitions. [2018-12-08 19:55:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:12,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:55:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 1937 states and 2414 transitions. [2018-12-08 19:55:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2414 transitions. [2018-12-08 19:55:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:17,393 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:55:21,169 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-08 19:55:25,507 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-12-08 19:55:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 1953 states and 2433 transitions. [2018-12-08 19:55:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2433 transitions. [2018-12-08 19:55:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:28,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:55:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 1957 states and 2438 transitions. [2018-12-08 19:55:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2438 transitions. [2018-12-08 19:55:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:29,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:55:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 1968 states and 2450 transitions. [2018-12-08 19:55:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2450 transitions. [2018-12-08 19:55:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:32,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 19:55:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 1974 states and 2457 transitions. [2018-12-08 19:55:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2457 transitions. [2018-12-08 19:55:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 19:55:34,778 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:55:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 1975 states and 2457 transitions. [2018-12-08 19:55:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2457 transitions. [2018-12-08 19:55:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 19:55:35,384 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 19:55:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 1985 states and 2471 transitions. [2018-12-08 19:55:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2471 transitions. [2018-12-08 19:55:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 19:55:38,175 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 19:55:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 1993 states and 2478 transitions. [2018-12-08 19:55:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2478 transitions. [2018-12-08 19:55:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 19:55:39,967 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-08 19:55:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2021 states and 2510 transitions. [2018-12-08 19:55:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2510 transitions. [2018-12-08 19:55:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 19:55:43,643 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:55:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2075 states and 2575 transitions. [2018-12-08 19:55:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2575 transitions. [2018-12-08 19:55:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-08 19:55:48,983 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 190 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:55:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2088 states and 2595 transitions. [2018-12-08 19:55:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2595 transitions. [2018-12-08 19:55:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 19:55:52,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 19:55:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:55:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2091 states and 2597 transitions. [2018-12-08 19:55:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2597 transitions. [2018-12-08 19:55:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 19:55:53,829 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:55:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:55:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 165 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:56:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2138 states and 2655 transitions. [2018-12-08 19:56:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2655 transitions. [2018-12-08 19:56:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 19:56:04,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:56:09,373 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-08 19:56:13,702 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-08 19:56:16,285 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-08 19:56:16,822 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-08 19:56:19,028 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-08 19:56:27,489 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-08 19:56:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2180 states and 2699 transitions. [2018-12-08 19:56:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2699 transitions. [2018-12-08 19:56:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 19:56:28,176 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 19:56:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2188 states and 2706 transitions. [2018-12-08 19:56:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2706 transitions. [2018-12-08 19:56:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 19:56:29,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 19:56:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2258 states and 2779 transitions. [2018-12-08 19:56:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2779 transitions. [2018-12-08 19:56:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 19:56:31,198 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-08 19:56:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2327 states and 2852 transitions. [2018-12-08 19:56:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2852 transitions. [2018-12-08 19:56:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:56:38,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:56:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2337 states and 2863 transitions. [2018-12-08 19:56:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2863 transitions. [2018-12-08 19:56:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:56:43,393 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 19:56:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2340 states and 2867 transitions. [2018-12-08 19:56:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2867 transitions. [2018-12-08 19:56:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:56:45,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-08 19:56:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2369 states and 2909 transitions. [2018-12-08 19:56:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 2909 transitions. [2018-12-08 19:56:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:56:58,065 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-08 19:56:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:56:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2370 states and 2909 transitions. [2018-12-08 19:56:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2909 transitions. [2018-12-08 19:56:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:56:58,693 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:56:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:56:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-08 19:57:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2379 states and 2916 transitions. [2018-12-08 19:57:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2916 transitions. [2018-12-08 19:57:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 19:57:04,524 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-08 19:57:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2390 states and 2926 transitions. [2018-12-08 19:57:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 2926 transitions. [2018-12-08 19:57:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-08 19:57:05,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:10,354 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-12-08 19:57:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 19:57:14,421 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-08 19:57:17,026 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-08 19:57:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2395 states and 2934 transitions. [2018-12-08 19:57:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2934 transitions. [2018-12-08 19:57:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:19,222 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2410 states and 2952 transitions. [2018-12-08 19:57:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2952 transitions. [2018-12-08 19:57:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:21,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2436 states and 2986 transitions. [2018-12-08 19:57:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2986 transitions. [2018-12-08 19:57:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:28,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2439 states and 2988 transitions. [2018-12-08 19:57:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2988 transitions. [2018-12-08 19:57:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:28,531 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2444 states and 2993 transitions. [2018-12-08 19:57:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2993 transitions. [2018-12-08 19:57:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:29,624 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2447 states and 2996 transitions. [2018-12-08 19:57:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2996 transitions. [2018-12-08 19:57:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-08 19:57:30,911 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-08 19:57:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2449 states and 2997 transitions. [2018-12-08 19:57:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 2997 transitions. [2018-12-08 19:57:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:31,552 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 2485 states and 3046 transitions. [2018-12-08 19:57:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3046 transitions. [2018-12-08 19:57:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:45,115 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 2491 states and 3055 transitions. [2018-12-08 19:57:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3055 transitions. [2018-12-08 19:57:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:48,241 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2493 states and 3056 transitions. [2018-12-08 19:57:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3056 transitions. [2018-12-08 19:57:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:48,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 2497 states and 3061 transitions. [2018-12-08 19:57:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 3061 transitions. [2018-12-08 19:57:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:49,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 2513 states and 3079 transitions. [2018-12-08 19:57:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3079 transitions. [2018-12-08 19:57:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:54,131 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 2526 states and 3089 transitions. [2018-12-08 19:57:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3089 transitions. [2018-12-08 19:57:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:58,302 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:57:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:57:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 2527 states and 3089 transitions. [2018-12-08 19:57:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-12-08 19:57:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:57:58,960 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:57:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:57:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:58:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 2534 states and 3095 transitions. [2018-12-08 19:58:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3095 transitions. [2018-12-08 19:58:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:58:00,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:58:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2536 states and 3097 transitions. [2018-12-08 19:58:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3097 transitions. [2018-12-08 19:58:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:58:01,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:58:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 2537 states and 3098 transitions. [2018-12-08 19:58:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3098 transitions. [2018-12-08 19:58:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:58:01,916 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:58:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 2538 states and 3098 transitions. [2018-12-08 19:58:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3098 transitions. [2018-12-08 19:58:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-08 19:58:02,381 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 19:58:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 2541 states and 3100 transitions. [2018-12-08 19:58:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3100 transitions. [2018-12-08 19:58:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:03,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2560 states and 3122 transitions. [2018-12-08 19:58:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3122 transitions. [2018-12-08 19:58:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:08,764 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 2563 states and 3124 transitions. [2018-12-08 19:58:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3124 transitions. [2018-12-08 19:58:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:09,714 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 2568 states and 3129 transitions. [2018-12-08 19:58:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3129 transitions. [2018-12-08 19:58:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:10,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 2573 states and 3136 transitions. [2018-12-08 19:58:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3136 transitions. [2018-12-08 19:58:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:12,151 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 2581 states and 3146 transitions. [2018-12-08 19:58:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3146 transitions. [2018-12-08 19:58:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:13,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2583 states and 3147 transitions. [2018-12-08 19:58:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3147 transitions. [2018-12-08 19:58:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 19:58:13,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:58:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2584 states and 3147 transitions. [2018-12-08 19:58:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3147 transitions. [2018-12-08 19:58:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-08 19:58:14,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 19:58:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 2599 states and 3176 transitions. [2018-12-08 19:58:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3176 transitions. [2018-12-08 19:58:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-08 19:58:20,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:58:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 276 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 19:58:25,135 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-08 19:58:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 19:58:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 2613 states and 3192 transitions. [2018-12-08 19:58:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3192 transitions. [2018-12-08 19:58:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-08 19:58:27,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 19:58:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:58:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:58:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:58:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:58:27,927 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 226 iterations. [2018-12-08 19:58:28,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 07:58:28 ImpRootNode [2018-12-08 19:58:28,030 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 19:58:28,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:58:28,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:58:28,031 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:58:28,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:51:59" (3/4) ... [2018-12-08 19:58:28,033 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:58:28,127 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e45890eb-2d4b-4d92-95c3-fc914a212562/bin-2019/ukojak/witness.graphml [2018-12-08 19:58:28,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:58:28,128 INFO L168 Benchmark]: Toolchain (without parser) took 389889.40 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -198.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,128 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:58:28,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,129 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,129 INFO L168 Benchmark]: RCFGBuilder took 967.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 886.0 MB in the end (delta: 202.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,129 INFO L168 Benchmark]: CodeCheck took 388428.70 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 886.0 MB in the beginning and 1.2 GB in the end (delta: -294.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,129 INFO L168 Benchmark]: Witness Printer took 96.87 ms. Allocated memory is still 2.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-08 19:58:28,130 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 388.2s OverallTime, 226 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 536871956 SDtfs, 1983611702 SDslu, -1610606472 SDs, 0 SdLazy, -1971353528 SolverSat, -2134111914 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1102.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223713 GetRequests, 216380 SyntacticMatches, 5141 SemanticMatches, 2192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3629816 ImplicationChecksByTransitivity, 360.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 32895 NumberOfCodeBlocks, 32895 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 32435 ConstructedInterpolants, 0 QuantifiedInterpolants, 22989537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 225 InterpolantComputations, 180 PerfectInterpolantSequences, 23603/25135 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 422]: 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 FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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 FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 967.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 886.0 MB in the end (delta: 202.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. * CodeCheck took 388428.70 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 886.0 MB in the beginning and 1.2 GB in the end (delta: -294.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 96.87 ms. Allocated memory is still 2.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...