./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/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 eb2ed652d9060283eed99b129e3cfec21e515617 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-26 22:54:59,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:54:59,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:54:59,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:54:59,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:54:59,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:54:59,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:54:59,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:54:59,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:54:59,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:54:59,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:54:59,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:54:59,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:54:59,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:55:00,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:55:00,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:55:00,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:55:00,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:55:00,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:55:00,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:55:00,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:55:00,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:55:00,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:55:00,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:55:00,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:55:00,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:55:00,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:55:00,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:55:00,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:55:00,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:55:00,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:55:00,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:55:00,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:55:00,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:55:00,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:55:00,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:55:00,029 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 22:55:00,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:55:00,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:55:00,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:55:00,040 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:55:00,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:55:00,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:55:00,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:55:00,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:55:00,042 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:55:00,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:55:00,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:55:00,042 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 22:55:00,042 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 22:55:00,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:55:00,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:55:00,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 22:55:00,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:55:00,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:55:00,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:55:00,045 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 22:55:00,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:55:00,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:55:00,046 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_a8c489a5-dc17-4f71-9be7-112851aece4e/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 -> eb2ed652d9060283eed99b129e3cfec21e515617 [2018-10-26 22:55:00,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:55:00,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:55:00,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:55:00,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:55:00,096 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:55:00,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-10-26 22:55:00,140 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/data/ea35cd83f/18a16fe4b5af4bcca3ecd30b98e065c9/FLAG2524e1f07 [2018-10-26 22:55:00,579 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:55:00,580 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-10-26 22:55:00,590 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/data/ea35cd83f/18a16fe4b5af4bcca3ecd30b98e065c9/FLAG2524e1f07 [2018-10-26 22:55:00,602 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/data/ea35cd83f/18a16fe4b5af4bcca3ecd30b98e065c9 [2018-10-26 22:55:00,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:55:00,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:55:00,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:55:00,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:55:00,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:55:00,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:55:00" (1/1) ... [2018-10-26 22:55:00,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:00, skipping insertion in model container [2018-10-26 22:55:00,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:55:00" (1/1) ... [2018-10-26 22:55:00,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:55:00,671 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:55:00,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:55:00,973 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:55:01,060 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:55:01,073 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:55:01,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01 WrapperNode [2018-10-26 22:55:01,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:55:01,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:55:01,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:55:01,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:55:01,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:55:01,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:55:01,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:55:01,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:55:01,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... [2018-10-26 22:55:01,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:55:01,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:55:01,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:55:01,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:55:01,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:55:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/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-10-26 22:55:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:55:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:55:01,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:55:05,517 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:55:05,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:55:05 BoogieIcfgContainer [2018-10-26 22:55:05,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:55:05,518 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 22:55:05,518 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 22:55:05,527 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 22:55:05,527 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:55:05" (1/1) ... [2018-10-26 22:55:05,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-10-26 22:55:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-10-26 22:55:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 22:55:05,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-10-26 22:55:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-10-26 22:55:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:55:06,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 245 states and 339 transitions. [2018-10-26 22:55:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2018-10-26 22:55:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 22:55:08,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 250 states and 345 transitions. [2018-10-26 22:55:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2018-10-26 22:55:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 22:55:08,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 260 states and 360 transitions. [2018-10-26 22:55:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 360 transitions. [2018-10-26 22:55:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 22:55:08,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 263 states and 363 transitions. [2018-10-26 22:55:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2018-10-26 22:55:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 22:55:08,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 268 states and 370 transitions. [2018-10-26 22:55:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2018-10-26 22:55:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 22:55:08,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:55:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 273 states and 376 transitions. [2018-10-26 22:55:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2018-10-26 22:55:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 22:55:09,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 291 states and 402 transitions. [2018-10-26 22:55:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2018-10-26 22:55:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 22:55:09,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:55:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 292 states and 404 transitions. [2018-10-26 22:55:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2018-10-26 22:55:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 22:55:09,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:55:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 296 states and 408 transitions. [2018-10-26 22:55:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 408 transitions. [2018-10-26 22:55:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 22:55:10,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:10,348 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:55:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 300 states and 413 transitions. [2018-10-26 22:55:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 413 transitions. [2018-10-26 22:55:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 22:55:10,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 324 states and 445 transitions. [2018-10-26 22:55:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2018-10-26 22:55:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 22:55:11,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 326 states and 447 transitions. [2018-10-26 22:55:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 447 transitions. [2018-10-26 22:55:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 22:55:11,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:55:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 406 states and 530 transitions. [2018-10-26 22:55:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2018-10-26 22:55:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 22:55:12,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:13,463 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:55:14,114 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 22:55:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 429 states and 561 transitions. [2018-10-26 22:55:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2018-10-26 22:55:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 22:55:14,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 433 states and 565 transitions. [2018-10-26 22:55:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 565 transitions. [2018-10-26 22:55:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 22:55:15,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 437 states and 569 transitions. [2018-10-26 22:55:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 569 transitions. [2018-10-26 22:55:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 22:55:15,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 471 states and 616 transitions. [2018-10-26 22:55:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2018-10-26 22:55:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 22:55:17,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:18,031 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:55:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-10-26 22:55:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-10-26 22:55:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 22:55:18,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:55:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 477 states and 622 transitions. [2018-10-26 22:55:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 622 transitions. [2018-10-26 22:55:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 22:55:18,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 491 states and 642 transitions. [2018-10-26 22:55:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2018-10-26 22:55:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 22:55:19,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 498 states and 649 transitions. [2018-10-26 22:55:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 649 transitions. [2018-10-26 22:55:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 22:55:19,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 502 states and 653 transitions. [2018-10-26 22:55:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2018-10-26 22:55:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 22:55:19,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 22:55:20,004 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 22:55:21,512 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 22:55:22,355 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:55:22,920 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 22:55:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 509 states and 661 transitions. [2018-10-26 22:55:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2018-10-26 22:55:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 22:55:23,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 513 states and 668 transitions. [2018-10-26 22:55:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2018-10-26 22:55:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:55:23,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 537 states and 698 transitions. [2018-10-26 22:55:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 698 transitions. [2018-10-26 22:55:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:55:24,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 541 states and 701 transitions. [2018-10-26 22:55:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 701 transitions. [2018-10-26 22:55:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:55:25,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2018-10-26 22:55:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2018-10-26 22:55:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:55:25,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2018-10-26 22:55:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2018-10-26 22:55:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 22:55:25,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 549 states and 711 transitions. [2018-10-26 22:55:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-10-26 22:55:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 22:55:25,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:55:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 570 states and 734 transitions. [2018-10-26 22:55:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 734 transitions. [2018-10-26 22:55:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 22:55:28,402 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 589 states and 760 transitions. [2018-10-26 22:55:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 760 transitions. [2018-10-26 22:55:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 22:55:30,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 593 states and 764 transitions. [2018-10-26 22:55:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 764 transitions. [2018-10-26 22:55:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 22:55:30,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 609 states and 782 transitions. [2018-10-26 22:55:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 782 transitions. [2018-10-26 22:55:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 22:55:30,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 618 states and 792 transitions. [2018-10-26 22:55:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 792 transitions. [2018-10-26 22:55:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 22:55:31,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 620 states and 794 transitions. [2018-10-26 22:55:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 794 transitions. [2018-10-26 22:55:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 22:55:31,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 22:55:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 622 states and 795 transitions. [2018-10-26 22:55:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 795 transitions. [2018-10-26 22:55:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 22:55:31,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:55:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 629 states and 805 transitions. [2018-10-26 22:55:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 805 transitions. [2018-10-26 22:55:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 22:55:31,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:55:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 633 states and 810 transitions. [2018-10-26 22:55:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 810 transitions. [2018-10-26 22:55:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 22:55:32,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 637 states and 816 transitions. [2018-10-26 22:55:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 816 transitions. [2018-10-26 22:55:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 22:55:32,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 639 states and 818 transitions. [2018-10-26 22:55:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 818 transitions. [2018-10-26 22:55:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 22:55:32,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 640 states and 819 transitions. [2018-10-26 22:55:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 819 transitions. [2018-10-26 22:55:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 22:55:32,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 22:55:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 692 states and 878 transitions. [2018-10-26 22:55:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 878 transitions. [2018-10-26 22:55:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 22:55:33,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 693 states and 879 transitions. [2018-10-26 22:55:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 879 transitions. [2018-10-26 22:55:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 22:55:33,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:55:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 699 states and 886 transitions. [2018-10-26 22:55:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 886 transitions. [2018-10-26 22:55:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 22:55:34,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 700 states and 888 transitions. [2018-10-26 22:55:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 888 transitions. [2018-10-26 22:55:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 22:55:34,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 706 states and 893 transitions. [2018-10-26 22:55:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 893 transitions. [2018-10-26 22:55:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 22:55:35,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 22:55:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 710 states and 899 transitions. [2018-10-26 22:55:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 899 transitions. [2018-10-26 22:55:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 22:55:35,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 22:55:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 712 states and 900 transitions. [2018-10-26 22:55:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 900 transitions. [2018-10-26 22:55:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 22:55:35,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 730 states and 921 transitions. [2018-10-26 22:55:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 921 transitions. [2018-10-26 22:55:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 22:55:36,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:55:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 734 states and 924 transitions. [2018-10-26 22:55:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 924 transitions. [2018-10-26 22:55:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 22:55:36,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 763 states and 956 transitions. [2018-10-26 22:55:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 956 transitions. [2018-10-26 22:55:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 22:55:37,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 782 states and 978 transitions. [2018-10-26 22:55:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 978 transitions. [2018-10-26 22:55:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:55:38,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 783 states and 979 transitions. [2018-10-26 22:55:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 979 transitions. [2018-10-26 22:55:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:55:38,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 22:55:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 789 states and 984 transitions. [2018-10-26 22:55:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 984 transitions. [2018-10-26 22:55:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:55:38,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:55:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 811 states and 1014 transitions. [2018-10-26 22:55:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1014 transitions. [2018-10-26 22:55:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:55:40,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:55:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 815 states and 1018 transitions. [2018-10-26 22:55:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1018 transitions. [2018-10-26 22:55:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 22:55:40,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 818 states and 1021 transitions. [2018-10-26 22:55:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1021 transitions. [2018-10-26 22:55:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:55:40,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 843 states and 1047 transitions. [2018-10-26 22:55:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1047 transitions. [2018-10-26 22:55:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:55:41,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:55:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 861 states and 1064 transitions. [2018-10-26 22:55:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1064 transitions. [2018-10-26 22:55:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 22:55:42,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 878 states and 1088 transitions. [2018-10-26 22:55:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1088 transitions. [2018-10-26 22:55:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 22:55:43,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 882 states and 1092 transitions. [2018-10-26 22:55:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1092 transitions. [2018-10-26 22:55:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 22:55:43,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:55:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 886 states and 1096 transitions. [2018-10-26 22:55:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1096 transitions. [2018-10-26 22:55:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 22:55:44,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:55:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 910 states and 1123 transitions. [2018-10-26 22:55:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1123 transitions. [2018-10-26 22:55:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 22:55:45,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:55:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:55:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:55:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:55:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:55:45,705 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 65 iterations. [2018-10-26 22:55:45,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 10:55:45 ImpRootNode [2018-10-26 22:55:45,808 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 22:55:45,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:55:45,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:55:45,809 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:55:45,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:55:05" (3/4) ... [2018-10-26 22:55:45,819 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:55:46,005 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a8c489a5-dc17-4f71-9be7-112851aece4e/bin-2019/ukojak/witness.graphml [2018-10-26 22:55:46,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:55:46,006 INFO L168 Benchmark]: Toolchain (without parser) took 45397.57 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 721.9 MB). Free memory was 951.8 MB in the beginning and 1.4 GB in the end (delta: -428.6 MB). Peak memory consumption was 293.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,007 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:55:46,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.66 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 1.0 GB. Free memory was 922.2 MB in the beginning and 916.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,008 INFO L168 Benchmark]: Boogie Preprocessor took 135.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 916.9 MB in the beginning and 1.1 GB in the end (delta: -232.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,009 INFO L168 Benchmark]: RCFGBuilder took 4239.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 240.6 MB). Peak memory consumption was 240.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,009 INFO L168 Benchmark]: CodeCheck took 40290.42 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 559.9 MB). Free memory was 909.1 MB in the beginning and 1.4 GB in the end (delta: -488.7 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,009 INFO L168 Benchmark]: Witness Printer took 196.97 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:55:46,013 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, 228 locations, 1 error locations. UNSAFE Result, 40.1s OverallTime, 65 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16778808 SDtfs, 1109378458 SDslu, 142619656 SDs, 0 SdLazy, -1380968890 SolverSat, -789808416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 196.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53541 GetRequests, 52813 SyntacticMatches, 310 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110155 ImplicationChecksByTransitivity, 31.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 8483 NumberOfCodeBlocks, 8483 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 8262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2063013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 56 PerfectInterpolantSequences, 4407/4453 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: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] RET return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.66 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 1.0 GB. Free memory was 922.2 MB in the beginning and 916.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 916.9 MB in the beginning and 1.1 GB in the end (delta: -232.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4239.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.1 MB in the end (delta: 240.6 MB). Peak memory consumption was 240.6 MB. Max. memory is 11.5 GB. * CodeCheck took 40290.42 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 559.9 MB). Free memory was 909.1 MB in the beginning and 1.4 GB in the end (delta: -488.7 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. * Witness Printer took 196.97 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...