./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33_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_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/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 a503fea819b7f7110cbbc6f7f69d6be84492b6b4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:10:55,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:10:55,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:10:55,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:10:55,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:10:55,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:10:55,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:10:55,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:10:55,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:10:55,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:10:55,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:10:55,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:10:55,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:10:55,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:10:55,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:10:55,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:10:55,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:10:55,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:10:55,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:10:55,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:10:55,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:10:55,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:10:55,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:10:55,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:10:55,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:10:55,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:10:55,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:10:55,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:10:55,562 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:10:55,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:10:55,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:10:55,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:10:55,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:10:55,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:10:55,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:10:55,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:10:55,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 12:10:55,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:10:55,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:10:55,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:10:55,573 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 12:10:55,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:10:55,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 12:10:55,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 12:10:55,575 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 12:10:55,575 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:10:55,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:10:55,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:10:55,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:10:55,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 12:10:55,576 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 12:10:55,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:10:55,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 12:10:55,576 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_5011695d-b6f0-4b91-b862-5675834caa78/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 -> a503fea819b7f7110cbbc6f7f69d6be84492b6b4 [2018-12-08 12:10:55,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:10:55,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:10:55,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:10:55,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:10:55,604 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:10:55,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c [2018-12-08 12:10:55,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/data/31fcaa326/b3779fd27278414f8e5feb3d03b90ba0/FLAGb3cc5e33d [2018-12-08 12:10:55,975 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:10:55,976 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c [2018-12-08 12:10:55,983 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/data/31fcaa326/b3779fd27278414f8e5feb3d03b90ba0/FLAGb3cc5e33d [2018-12-08 12:10:55,991 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/data/31fcaa326/b3779fd27278414f8e5feb3d03b90ba0 [2018-12-08 12:10:55,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:10:55,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:10:55,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:10:55,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:10:55,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:10:55,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:10:55" (1/1) ... [2018-12-08 12:10:55,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:55, skipping insertion in model container [2018-12-08 12:10:56,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:10:55" (1/1) ... [2018-12-08 12:10:56,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:10:56,030 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:10:56,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:10:56,220 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:10:56,319 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:10:56,328 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:10:56,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56 WrapperNode [2018-12-08 12:10:56,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:10:56,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:10:56,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:10:56,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:10:56,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:10:56,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:10:56,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:10:56,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:10:56,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... [2018-12-08 12:10:56,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:10:56,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:10:56,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:10:56,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:10:56,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/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 12:10:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:10:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:10:57,395 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:10:57,395 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 12:10:57,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:10:57 BoogieIcfgContainer [2018-12-08 12:10:57,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:10:57,396 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 12:10:57,396 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 12:10:57,402 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 12:10:57,402 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:10:57" (1/1) ... [2018-12-08 12:10:57,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:10:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-08 12:10:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-08 12:10:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 12:10:57,436 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:57,629 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 12:10:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2018-12-08 12:10:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2018-12-08 12:10:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:10:57,940 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:10:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2018-12-08 12:10:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2018-12-08 12:10:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 12:10:58,130 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,153 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 12:10:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2018-12-08 12:10:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2018-12-08 12:10:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 12:10:58,231 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,247 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 12:10:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2018-12-08 12:10:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2018-12-08 12:10:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 12:10:58,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,354 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 12:10:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2018-12-08 12:10:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2018-12-08 12:10:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 12:10:58,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,547 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 12:10:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2018-12-08 12:10:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2018-12-08 12:10:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 12:10:58,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,887 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 12:10:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2018-12-08 12:10:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2018-12-08 12:10:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 12:10:58,920 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:58,953 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 12:10:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2018-12-08 12:10:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2018-12-08 12:10:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 12:10:59,035 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:59,109 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 12:10:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2018-12-08 12:10:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2018-12-08 12:10:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 12:10:59,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:59,547 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 12:10:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2018-12-08 12:10:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2018-12-08 12:10:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 12:10:59,802 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:59,822 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 12:10:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2018-12-08 12:10:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2018-12-08 12:10:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 12:10:59,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:59,921 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 12:10:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2018-12-08 12:10:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2018-12-08 12:10:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 12:10:59,934 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:10:59,954 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 12:10:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:10:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2018-12-08 12:10:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2018-12-08 12:10:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 12:10:59,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:10:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:00,047 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 12:11:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2018-12-08 12:11:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2018-12-08 12:11:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 12:11:00,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2018-12-08 12:11:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2018-12-08 12:11:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 12:11:00,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:11:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2018-12-08 12:11:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2018-12-08 12:11:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 12:11:00,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:00,641 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 12:11:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2018-12-08 12:11:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2018-12-08 12:11:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 12:11:00,844 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2018-12-08 12:11:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2018-12-08 12:11:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 12:11:01,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:01,054 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 12:11:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 236 states and 376 transitions. [2018-12-08 12:11:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 376 transitions. [2018-12-08 12:11:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 12:11:01,324 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:01,336 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 12:11:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2018-12-08 12:11:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2018-12-08 12:11:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:11:01,595 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 12:11:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2018-12-08 12:11:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2018-12-08 12:11:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 12:11:01,700 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:11:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2018-12-08 12:11:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2018-12-08 12:11:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 12:11:01,984 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2018-12-08 12:11:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2018-12-08 12:11:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 12:11:02,777 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 12:11:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2018-12-08 12:11:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2018-12-08 12:11:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 12:11:02,892 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:02,926 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 12:11:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2018-12-08 12:11:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2018-12-08 12:11:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 12:11:02,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2018-12-08 12:11:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2018-12-08 12:11:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 12:11:03,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2018-12-08 12:11:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2018-12-08 12:11:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 12:11:03,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:03,555 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 12:11:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2018-12-08 12:11:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2018-12-08 12:11:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 12:11:04,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2018-12-08 12:11:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2018-12-08 12:11:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:05,086 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2018-12-08 12:11:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2018-12-08 12:11:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:07,348 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 373 states and 559 transitions. [2018-12-08 12:11:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 559 transitions. [2018-12-08 12:11:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:07,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 374 states and 561 transitions. [2018-12-08 12:11:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 561 transitions. [2018-12-08 12:11:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:08,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 379 states and 567 transitions. [2018-12-08 12:11:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 567 transitions. [2018-12-08 12:11:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:08,648 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 389 states and 578 transitions. [2018-12-08 12:11:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 578 transitions. [2018-12-08 12:11:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:08,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 390 states and 579 transitions. [2018-12-08 12:11:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 579 transitions. [2018-12-08 12:11:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:09,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2018-12-08 12:11:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2018-12-08 12:11:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:11:09,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2018-12-08 12:11:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2018-12-08 12:11:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 12:11:09,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:09,823 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 12:11:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 407 states and 607 transitions. [2018-12-08 12:11:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2018-12-08 12:11:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 12:11:11,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:11,086 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 12:11:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 418 states and 618 transitions. [2018-12-08 12:11:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 618 transitions. [2018-12-08 12:11:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:11:11,475 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:11:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 429 states and 631 transitions. [2018-12-08 12:11:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 631 transitions. [2018-12-08 12:11:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 12:11:12,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:12,217 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 12:11:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 438 states and 642 transitions. [2018-12-08 12:11:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 642 transitions. [2018-12-08 12:11:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 12:11:12,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:12,958 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 12:11:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 466 states and 674 transitions. [2018-12-08 12:11:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 674 transitions. [2018-12-08 12:11:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 12:11:14,336 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:14,368 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 12:11:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 489 states and 704 transitions. [2018-12-08 12:11:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 704 transitions. [2018-12-08 12:11:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 12:11:15,703 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:15,724 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 12:11:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 494 states and 708 transitions. [2018-12-08 12:11:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 708 transitions. [2018-12-08 12:11:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 12:11:16,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:16,101 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 12:11:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 502 states and 720 transitions. [2018-12-08 12:11:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 720 transitions. [2018-12-08 12:11:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 12:11:16,331 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 503 states and 721 transitions. [2018-12-08 12:11:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 721 transitions. [2018-12-08 12:11:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 12:11:16,791 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 511 states and 728 transitions. [2018-12-08 12:11:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 728 transitions. [2018-12-08 12:11:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 12:11:17,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:17,266 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 12:11:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 581 states and 813 transitions. [2018-12-08 12:11:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 813 transitions. [2018-12-08 12:11:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 12:11:17,691 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 600 states and 836 transitions. [2018-12-08 12:11:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 836 transitions. [2018-12-08 12:11:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 12:11:18,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 602 states and 836 transitions. [2018-12-08 12:11:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 836 transitions. [2018-12-08 12:11:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 12:11:19,207 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,220 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 12:11:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 611 states and 848 transitions. [2018-12-08 12:11:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 848 transitions. [2018-12-08 12:11:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 12:11:19,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 624 states and 863 transitions. [2018-12-08 12:11:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 863 transitions. [2018-12-08 12:11:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 12:11:19,519 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,533 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 12:11:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 626 states and 864 transitions. [2018-12-08 12:11:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 864 transitions. [2018-12-08 12:11:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 12:11:19,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,633 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 12:11:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 630 states and 867 transitions. [2018-12-08 12:11:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 867 transitions. [2018-12-08 12:11:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 12:11:19,742 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,757 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 12:11:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 632 states and 868 transitions. [2018-12-08 12:11:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 868 transitions. [2018-12-08 12:11:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 12:11:19,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 646 states and 884 transitions. [2018-12-08 12:11:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 884 transitions. [2018-12-08 12:11:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-08 12:11:20,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 12:11:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 648 states and 887 transitions. [2018-12-08 12:11:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 887 transitions. [2018-12-08 12:11:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 12:11:20,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:20,500 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 12:11:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 693 states and 936 transitions. [2018-12-08 12:11:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 936 transitions. [2018-12-08 12:11:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 12:11:23,352 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 12:11:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 768 states and 1014 transitions. [2018-12-08 12:11:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1014 transitions. [2018-12-08 12:11:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 12:11:23,936 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:11:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 774 states and 1021 transitions. [2018-12-08 12:11:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1021 transitions. [2018-12-08 12:11:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 12:11:24,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:11:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 779 states and 1025 transitions. [2018-12-08 12:11:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1025 transitions. [2018-12-08 12:11:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 12:11:24,782 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 12:11:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 800 states and 1051 transitions. [2018-12-08 12:11:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1051 transitions. [2018-12-08 12:11:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-08 12:11:25,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:11:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 803 states and 1054 transitions. [2018-12-08 12:11:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1054 transitions. [2018-12-08 12:11:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-08 12:11:25,394 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 814 states and 1072 transitions. [2018-12-08 12:11:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1072 transitions. [2018-12-08 12:11:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:11:26,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 829 states and 1097 transitions. [2018-12-08 12:11:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1097 transitions. [2018-12-08 12:11:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 12:11:27,386 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 859 states and 1131 transitions. [2018-12-08 12:11:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1131 transitions. [2018-12-08 12:11:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:11:29,712 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 861 states and 1134 transitions. [2018-12-08 12:11:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1134 transitions. [2018-12-08 12:11:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:11:29,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 896 states and 1182 transitions. [2018-12-08 12:11:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1182 transitions. [2018-12-08 12:11:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:11:33,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 905 states and 1191 transitions. [2018-12-08 12:11:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1191 transitions. [2018-12-08 12:11:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:11:34,916 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 909 states and 1195 transitions. [2018-12-08 12:11:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1195 transitions. [2018-12-08 12:11:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:11:35,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:11:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 910 states and 1196 transitions. [2018-12-08 12:11:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1196 transitions. [2018-12-08 12:11:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 12:11:35,494 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 935 states and 1223 transitions. [2018-12-08 12:11:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1223 transitions. [2018-12-08 12:11:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 12:11:37,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 12:11:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 965 states and 1257 transitions. [2018-12-08 12:11:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1257 transitions. [2018-12-08 12:11:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 12:11:37,745 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:11:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 972 states and 1265 transitions. [2018-12-08 12:11:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1265 transitions. [2018-12-08 12:11:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 12:11:38,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:11:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 977 states and 1273 transitions. [2018-12-08 12:11:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1273 transitions. [2018-12-08 12:11:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 12:11:38,925 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:39,646 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 12:11:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1034 states and 1334 transitions. [2018-12-08 12:11:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1334 transitions. [2018-12-08 12:11:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 12:11:46,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:48,925 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-08 12:11:50,151 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-08 12:11:51,434 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-08 12:11:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1092 states and 1396 transitions. [2018-12-08 12:11:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1396 transitions. [2018-12-08 12:11:53,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 12:11:53,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1103 states and 1407 transitions. [2018-12-08 12:11:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1407 transitions. [2018-12-08 12:11:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 12:11:54,278 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-08 12:11:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1104 states and 1407 transitions. [2018-12-08 12:11:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1407 transitions. [2018-12-08 12:11:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 12:11:54,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:55,927 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-08 12:11:57,642 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-12-08 12:11:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1145 states and 1453 transitions. [2018-12-08 12:11:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1453 transitions. [2018-12-08 12:11:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 12:11:58,194 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1148 states and 1458 transitions. [2018-12-08 12:11:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1458 transitions. [2018-12-08 12:11:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 12:11:58,810 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1152 states and 1461 transitions. [2018-12-08 12:11:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1461 transitions. [2018-12-08 12:11:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 12:11:59,127 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:11:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:11:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:11:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1156 states and 1466 transitions. [2018-12-08 12:11:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1466 transitions. [2018-12-08 12:11:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 12:11:59,906 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:11:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:12:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1161 states and 1475 transitions. [2018-12-08 12:12:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1475 transitions. [2018-12-08 12:12:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 12:12:00,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1172 states and 1487 transitions. [2018-12-08 12:12:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1487 transitions. [2018-12-08 12:12:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 12:12:00,882 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:12:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1176 states and 1493 transitions. [2018-12-08 12:12:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1493 transitions. [2018-12-08 12:12:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 12:12:01,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 12:12:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1206 states and 1533 transitions. [2018-12-08 12:12:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1533 transitions. [2018-12-08 12:12:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 12:12:04,384 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:12:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1208 states and 1535 transitions. [2018-12-08 12:12:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1535 transitions. [2018-12-08 12:12:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:12:04,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 12:12:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1218 states and 1549 transitions. [2018-12-08 12:12:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1549 transitions. [2018-12-08 12:12:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 12:12:05,475 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1248 states and 1586 transitions. [2018-12-08 12:12:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1586 transitions. [2018-12-08 12:12:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 12:12:11,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 12:12:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1257 states and 1597 transitions. [2018-12-08 12:12:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1597 transitions. [2018-12-08 12:12:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 12:12:11,819 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 12:12:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1258 states and 1597 transitions. [2018-12-08 12:12:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1597 transitions. [2018-12-08 12:12:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 12:12:12,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:12:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1270 states and 1610 transitions. [2018-12-08 12:12:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1610 transitions. [2018-12-08 12:12:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 12:12:12,728 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:12:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1271 states and 1610 transitions. [2018-12-08 12:12:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1610 transitions. [2018-12-08 12:12:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 12:12:13,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 12:12:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1291 states and 1635 transitions. [2018-12-08 12:12:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1635 transitions. [2018-12-08 12:12:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 12:12:14,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1317 states and 1664 transitions. [2018-12-08 12:12:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1664 transitions. [2018-12-08 12:12:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-08 12:12:15,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:12:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1324 states and 1671 transitions. [2018-12-08 12:12:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1671 transitions. [2018-12-08 12:12:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 12:12:15,159 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1375 states and 1732 transitions. [2018-12-08 12:12:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1732 transitions. [2018-12-08 12:12:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 12:12:18,813 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1386 states and 1742 transitions. [2018-12-08 12:12:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2018-12-08 12:12:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 12:12:19,388 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:12:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1416 states and 1776 transitions. [2018-12-08 12:12:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1776 transitions. [2018-12-08 12:12:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 12:12:20,797 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:12:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1426 states and 1787 transitions. [2018-12-08 12:12:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1787 transitions. [2018-12-08 12:12:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 12:12:23,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:12:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1431 states and 1793 transitions. [2018-12-08 12:12:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1793 transitions. [2018-12-08 12:12:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 12:12:24,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 12:12:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1441 states and 1802 transitions. [2018-12-08 12:12:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1802 transitions. [2018-12-08 12:12:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 12:12:25,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1481 states and 1846 transitions. [2018-12-08 12:12:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1846 transitions. [2018-12-08 12:12:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 12:12:27,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 12:12:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1501 states and 1867 transitions. [2018-12-08 12:12:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1867 transitions. [2018-12-08 12:12:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 12:12:28,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 12:12:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1522 states and 1894 transitions. [2018-12-08 12:12:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1894 transitions. [2018-12-08 12:12:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 12:12:29,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:30,494 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 12:12:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1570 states and 1942 transitions. [2018-12-08 12:12:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1942 transitions. [2018-12-08 12:12:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-08 12:12:33,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 12:12:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1600 states and 1983 transitions. [2018-12-08 12:12:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1983 transitions. [2018-12-08 12:12:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-08 12:12:35,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 12:12:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1608 states and 1994 transitions. [2018-12-08 12:12:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1994 transitions. [2018-12-08 12:12:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 12:12:37,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-08 12:12:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1615 states and 2002 transitions. [2018-12-08 12:12:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2002 transitions. [2018-12-08 12:12:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 12:12:37,699 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 12:12:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 1641 states and 2026 transitions. [2018-12-08 12:12:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2026 transitions. [2018-12-08 12:12:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-08 12:12:37,953 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 12:12:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 1645 states and 2031 transitions. [2018-12-08 12:12:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2031 transitions. [2018-12-08 12:12:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 12:12:38,535 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 12:12:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1649 states and 2036 transitions. [2018-12-08 12:12:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2036 transitions. [2018-12-08 12:12:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 12:12:39,161 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 12:12:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1669 states and 2060 transitions. [2018-12-08 12:12:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2060 transitions. [2018-12-08 12:12:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 12:12:40,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 12:12:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1679 states and 2069 transitions. [2018-12-08 12:12:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2069 transitions. [2018-12-08 12:12:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 12:12:42,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:12:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1683 states and 2074 transitions. [2018-12-08 12:12:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2074 transitions. [2018-12-08 12:12:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 12:12:46,976 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:48,485 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 12:12:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1743 states and 2134 transitions. [2018-12-08 12:12:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2134 transitions. [2018-12-08 12:12:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 12:12:51,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 12:12:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1747 states and 2140 transitions. [2018-12-08 12:12:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2140 transitions. [2018-12-08 12:12:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 12:12:54,308 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 12:12:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1817 states and 2215 transitions. [2018-12-08 12:12:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2215 transitions. [2018-12-08 12:12:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 12:12:56,084 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-08 12:12:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:12:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1826 states and 2240 transitions. [2018-12-08 12:12:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2240 transitions. [2018-12-08 12:12:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 12:12:57,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:12:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:12:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-08 12:13:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 1892 states and 2315 transitions. [2018-12-08 12:13:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2315 transitions. [2018-12-08 12:13:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 12:13:06,528 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-08 12:13:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1932 states and 2357 transitions. [2018-12-08 12:13:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2357 transitions. [2018-12-08 12:13:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 12:13:09,628 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-08 12:13:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1933 states and 2357 transitions. [2018-12-08 12:13:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2357 transitions. [2018-12-08 12:13:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-08 12:13:10,460 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 12:13:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 1943 states and 2372 transitions. [2018-12-08 12:13:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2372 transitions. [2018-12-08 12:13:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-08 12:13:11,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 12:13:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 1967 states and 2400 transitions. [2018-12-08 12:13:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2400 transitions. [2018-12-08 12:13:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:14,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-08 12:13:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1972 states and 2406 transitions. [2018-12-08 12:13:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2406 transitions. [2018-12-08 12:13:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:16,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-08 12:13:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1973 states and 2408 transitions. [2018-12-08 12:13:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2408 transitions. [2018-12-08 12:13:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:17,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 1975 states and 2412 transitions. [2018-12-08 12:13:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2412 transitions. [2018-12-08 12:13:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:18,020 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1995 states and 2439 transitions. [2018-12-08 12:13:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2439 transitions. [2018-12-08 12:13:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:19,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2011 states and 2457 transitions. [2018-12-08 12:13:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2457 transitions. [2018-12-08 12:13:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:21,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2013 states and 2457 transitions. [2018-12-08 12:13:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2457 transitions. [2018-12-08 12:13:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:24,659 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2045 states and 2493 transitions. [2018-12-08 12:13:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2493 transitions. [2018-12-08 12:13:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:29,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2046 states and 2493 transitions. [2018-12-08 12:13:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2493 transitions. [2018-12-08 12:13:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 12:13:29,744 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 12:13:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2047 states and 2493 transitions. [2018-12-08 12:13:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2493 transitions. [2018-12-08 12:13:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-08 12:13:30,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 12:13:33,602 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-08 12:13:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2072 states and 2520 transitions. [2018-12-08 12:13:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2520 transitions. [2018-12-08 12:13:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-08 12:13:36,032 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 12:13:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2074 states and 2523 transitions. [2018-12-08 12:13:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2523 transitions. [2018-12-08 12:13:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-08 12:13:36,381 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 12:13:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2100 states and 2552 transitions. [2018-12-08 12:13:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2552 transitions. [2018-12-08 12:13:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-08 12:13:39,089 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 12:13:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2111 states and 2562 transitions. [2018-12-08 12:13:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2562 transitions. [2018-12-08 12:13:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-08 12:13:40,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:41,730 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 12:13:43,359 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-08 12:13:46,062 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-08 12:13:46,811 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-08 12:13:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2163 states and 2616 transitions. [2018-12-08 12:13:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2616 transitions. [2018-12-08 12:13:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 12:13:50,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:13:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 229 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:13:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:13:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2169 states and 2621 transitions. [2018-12-08 12:13:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2621 transitions. [2018-12-08 12:13:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 12:13:52,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:13:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:13:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:13:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:13:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:13:52,530 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 141 iterations. [2018-12-08 12:13:52,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 12:13:52 ImpRootNode [2018-12-08 12:13:52,630 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 12:13:52,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:13:52,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:13:52,631 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:13:52,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:10:57" (3/4) ... [2018-12-08 12:13:52,633 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 12:13:52,728 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5011695d-b6f0-4b91-b862-5675834caa78/bin-2019/ukojak/witness.graphml [2018-12-08 12:13:52,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:13:52,729 INFO L168 Benchmark]: Toolchain (without parser) took 176735.41 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 949.5 MB in the beginning and 1.8 GB in the end (delta: -894.9 MB). Peak memory consumption was 390.1 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,729 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:13:52,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.08 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,730 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:13:52,730 INFO L168 Benchmark]: RCFGBuilder took 998.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 853.2 MB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,730 INFO L168 Benchmark]: CodeCheck took 175234.35 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 853.2 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,730 INFO L168 Benchmark]: Witness Printer took 97.88 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-12-08 12:13:52,732 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, 175.1s OverallTime, 141 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1979719736 SDtfs, -228183270 SDslu, -486489976 SDs, 0 SdLazy, 1881045472 SolverSat, 1652032194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 443.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139806 GetRequests, 135899 SyntacticMatches, 2377 SemanticMatches, 1530 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686109 ImplicationChecksByTransitivity, 158.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 20081 NumberOfCodeBlocks, 20081 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 19728 ConstructedInterpolants, 0 QuantifiedInterpolants, 12892811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 140 InterpolantComputations, 110 PerfectInterpolantSequences, 14559/14976 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: 407]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L103] a20 = 0 [L104] a8 = 15 [L105] a17 = 0 [L106] a21 = 1 [L107] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND 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))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.08 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 998.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 853.2 MB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 11.5 GB. * CodeCheck took 175234.35 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 853.2 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. * Witness Printer took 97.88 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...