./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-678e011 [2019-11-20 00:45:43,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:45:43,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:45:43,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:45:43,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:45:43,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:45:43,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:45:43,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:45:43,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:45:43,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:45:43,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:45:43,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:45:43,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:45:43,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:45:43,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:45:43,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:45:43,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:45:43,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:45:43,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:45:43,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:45:43,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:45:43,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:45:43,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:45:43,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:45:43,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:45:43,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:45:43,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:45:43,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:45:43,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:45:43,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:45:43,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:45:43,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:45:43,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:45:43,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:45:43,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:45:43,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:45:43,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:45:43,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:45:43,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:45:43,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:45:43,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:45:43,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 00:45:43,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:45:43,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:45:43,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:45:43,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:45:43,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:45:43,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:45:43,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:45:43,700 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:45:43,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:45:43,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:45:43,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:45:43,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:45:43,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:45:43,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:45:43,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:45:43,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:45:43,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:45:43,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:45:43,703 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:45:43,703 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:45:43,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:45:43,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:45:43,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:45:43,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:45:43,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:45:43,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:45:43,705 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 00:45:43,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:45:43,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:45:43,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2ed652d9060283eed99b129e3cfec21e515617 [2019-11-20 00:45:43,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:45:43,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:45:43,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:45:43,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:45:43,856 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:45:43,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2019-11-20 00:45:43,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/data/cfebb7c42/a5aa686d648940f3baddd291a4bf6e20/FLAG3fa44b022 [2019-11-20 00:45:44,353 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:45:44,354 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/sv-benchmarks/c/eca-rers2012/Problem02_label44.c [2019-11-20 00:45:44,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/data/cfebb7c42/a5aa686d648940f3baddd291a4bf6e20/FLAG3fa44b022 [2019-11-20 00:45:44,628 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/data/cfebb7c42/a5aa686d648940f3baddd291a4bf6e20 [2019-11-20 00:45:44,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:45:44,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:45:44,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:45:44,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:45:44,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:45:44,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:44" (1/1) ... [2019-11-20 00:45:44,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd093d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:44, skipping insertion in model container [2019-11-20 00:45:44,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:44" (1/1) ... [2019-11-20 00:45:44,650 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:45:44,704 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:45:45,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:45:45,121 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:45:45,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:45:45,221 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:45:45,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45 WrapperNode [2019-11-20 00:45:45,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:45:45,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:45:45,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:45:45,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:45:45,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:45:45,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:45:45,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:45:45,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:45:45,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... [2019-11-20 00:45:45,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:45:45,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:45:45,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:45:45,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:45:45,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:45:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:45:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:45:47,420 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:45:47,421 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:45:47,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:47 BoogieIcfgContainer [2019-11-20 00:45:47,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:45:47,423 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:45:47,423 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:45:47,432 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:45:47,433 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:47" (1/1) ... [2019-11-20 00:45:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2019-11-20 00:45:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2019-11-20 00:45:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:45:47,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2019-11-20 00:45:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-20 00:45:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:45:48,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2019-11-20 00:45:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2019-11-20 00:45:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 00:45:49,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 246 states and 341 transitions. [2019-11-20 00:45:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2019-11-20 00:45:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:45:49,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 255 states and 355 transitions. [2019-11-20 00:45:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2019-11-20 00:45:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:45:49,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 258 states and 358 transitions. [2019-11-20 00:45:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2019-11-20 00:45:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 00:45:49,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 262 states and 364 transitions. [2019-11-20 00:45:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2019-11-20 00:45:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 00:45:50,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:45:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 266 states and 369 transitions. [2019-11-20 00:45:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2019-11-20 00:45:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:45:50,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 283 states and 394 transitions. [2019-11-20 00:45:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2019-11-20 00:45:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:45:50,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 284 states and 396 transitions. [2019-11-20 00:45:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2019-11-20 00:45:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:45:50,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 287 states and 399 transitions. [2019-11-20 00:45:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 399 transitions. [2019-11-20 00:45:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:45:51,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 290 states and 403 transitions. [2019-11-20 00:45:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2019-11-20 00:45:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:45:51,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 313 states and 434 transitions. [2019-11-20 00:45:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2019-11-20 00:45:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 00:45:52,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:45:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 315 states and 436 transitions. [2019-11-20 00:45:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2019-11-20 00:45:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:45:52,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 394 states and 518 transitions. [2019-11-20 00:45:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2019-11-20 00:45:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 00:45:53,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 416 states and 548 transitions. [2019-11-20 00:45:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2019-11-20 00:45:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 00:45:54,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 419 states and 551 transitions. [2019-11-20 00:45:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2019-11-20 00:45:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 00:45:55,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 422 states and 554 transitions. [2019-11-20 00:45:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 554 transitions. [2019-11-20 00:45:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:45:55,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 454 states and 599 transitions. [2019-11-20 00:45:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2019-11-20 00:45:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:45:57,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 457 states and 602 transitions. [2019-11-20 00:45:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 602 transitions. [2019-11-20 00:45:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:45:58,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:45:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 459 states and 604 transitions. [2019-11-20 00:45:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-11-20 00:45:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 00:45:58,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:45:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 473 states and 624 transitions. [2019-11-20 00:45:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2019-11-20 00:45:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:45:58,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:45:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 477 states and 628 transitions. [2019-11-20 00:45:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2019-11-20 00:45:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:45:59,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:45:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 484 states and 635 transitions. [2019-11-20 00:45:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 635 transitions. [2019-11-20 00:45:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:45:59,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 00:45:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2019-11-20 00:45:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2019-11-20 00:45:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:45:59,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 515 states and 674 transitions. [2019-11-20 00:46:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 674 transitions. [2019-11-20 00:46:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:46:01,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 521 states and 680 transitions. [2019-11-20 00:46:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 680 transitions. [2019-11-20 00:46:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:46:02,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 525 states and 683 transitions. [2019-11-20 00:46:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 683 transitions. [2019-11-20 00:46:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:46:02,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:46:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2019-11-20 00:46:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2019-11-20 00:46:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:46:03,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:46:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 550 states and 714 transitions. [2019-11-20 00:46:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 714 transitions. [2019-11-20 00:46:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:46:03,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:46:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 551 states and 715 transitions. [2019-11-20 00:46:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2019-11-20 00:46:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:46:04,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2019-11-20 00:46:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2019-11-20 00:46:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 00:46:04,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 570 states and 741 transitions. [2019-11-20 00:46:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 741 transitions. [2019-11-20 00:46:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 00:46:05,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 573 states and 744 transitions. [2019-11-20 00:46:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2019-11-20 00:46:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 00:46:06,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 589 states and 762 transitions. [2019-11-20 00:46:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 762 transitions. [2019-11-20 00:46:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 00:46:06,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 00:46:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 591 states and 763 transitions. [2019-11-20 00:46:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2019-11-20 00:46:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 00:46:06,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 00:46:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 598 states and 773 transitions. [2019-11-20 00:46:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 773 transitions. [2019-11-20 00:46:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 00:46:07,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 00:46:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 602 states and 778 transitions. [2019-11-20 00:46:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 778 transitions. [2019-11-20 00:46:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 00:46:08,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:46:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 611 states and 788 transitions. [2019-11-20 00:46:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 788 transitions. [2019-11-20 00:46:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 00:46:08,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 613 states and 790 transitions. [2019-11-20 00:46:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 790 transitions. [2019-11-20 00:46:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 00:46:08,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 617 states and 797 transitions. [2019-11-20 00:46:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 797 transitions. [2019-11-20 00:46:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 00:46:09,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 619 states and 799 transitions. [2019-11-20 00:46:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 799 transitions. [2019-11-20 00:46:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 00:46:09,983 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:46:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 669 states and 855 transitions. [2019-11-20 00:46:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 855 transitions. [2019-11-20 00:46:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 00:46:11,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 674 states and 862 transitions. [2019-11-20 00:46:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 862 transitions. [2019-11-20 00:46:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 00:46:12,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 675 states and 863 transitions. [2019-11-20 00:46:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 863 transitions. [2019-11-20 00:46:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 00:46:12,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 00:46:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 681 states and 871 transitions. [2019-11-20 00:46:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 871 transitions. [2019-11-20 00:46:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 00:46:13,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 00:46:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 687 states and 877 transitions. [2019-11-20 00:46:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 877 transitions. [2019-11-20 00:46:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 00:46:13,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 688 states and 878 transitions. [2019-11-20 00:46:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 878 transitions. [2019-11-20 00:46:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:46:13,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 702 states and 892 transitions. [2019-11-20 00:46:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 892 transitions. [2019-11-20 00:46:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:46:14,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:46:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 706 states and 895 transitions. [2019-11-20 00:46:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 895 transitions. [2019-11-20 00:46:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 00:46:14,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 724 states and 917 transitions. [2019-11-20 00:46:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 917 transitions. [2019-11-20 00:46:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 00:46:16,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 725 states and 917 transitions. [2019-11-20 00:46:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 917 transitions. [2019-11-20 00:46:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 00:46:16,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 726 states and 918 transitions. [2019-11-20 00:46:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 918 transitions. [2019-11-20 00:46:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 00:46:16,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 730 states and 923 transitions. [2019-11-20 00:46:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 923 transitions. [2019-11-20 00:46:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 00:46:16,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 758 states and 954 transitions. [2019-11-20 00:46:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 954 transitions. [2019-11-20 00:46:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:46:17,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:46:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 786 states and 988 transitions. [2019-11-20 00:46:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 988 transitions. [2019-11-20 00:46:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:46:19,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:46:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 789 states and 991 transitions. [2019-11-20 00:46:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 991 transitions. [2019-11-20 00:46:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:46:19,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 792 states and 994 transitions. [2019-11-20 00:46:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 994 transitions. [2019-11-20 00:46:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:46:20,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 812 states and 1014 transitions. [2019-11-20 00:46:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1014 transitions. [2019-11-20 00:46:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:46:21,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 00:46:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 816 states and 1018 transitions. [2019-11-20 00:46:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1018 transitions. [2019-11-20 00:46:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 00:46:21,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 836 states and 1039 transitions. [2019-11-20 00:46:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1039 transitions. [2019-11-20 00:46:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 00:46:22,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 852 states and 1062 transitions. [2019-11-20 00:46:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1062 transitions. [2019-11-20 00:46:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 00:46:24,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 855 states and 1065 transitions. [2019-11-20 00:46:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1065 transitions. [2019-11-20 00:46:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 00:46:24,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 858 states and 1068 transitions. [2019-11-20 00:46:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1068 transitions. [2019-11-20 00:46:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 00:46:25,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 876 states and 1090 transitions. [2019-11-20 00:46:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1090 transitions. [2019-11-20 00:46:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 00:46:26,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 878 states and 1092 transitions. [2019-11-20 00:46:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1092 transitions. [2019-11-20 00:46:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 00:46:26,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:46:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 882 states and 1095 transitions. [2019-11-20 00:46:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1095 transitions. [2019-11-20 00:46:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:46:27,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:46:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:46:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:46:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:46:27,446 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 67 iterations. [2019-11-20 00:46:27,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 12:46:27 ImpRootNode [2019-11-20 00:46:27,635 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 00:46:27,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:46:27,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:46:27,636 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:46:27,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:47" (3/4) ... [2019-11-20 00:46:27,639 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:46:27,760 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8a99e6bf-0e8f-4184-928c-622dd32d50e0/bin/ukojak/witness.graphml [2019-11-20 00:46:27,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:46:27,762 INFO L168 Benchmark]: Toolchain (without parser) took 43129.69 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 958.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). Peak memory consumption was 713.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,762 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:46:27,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,763 INFO L168 Benchmark]: Boogie Preprocessor took 64.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,764 INFO L168 Benchmark]: RCFGBuilder took 2065.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.5 MB in the end (delta: 229.1 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,764 INFO L168 Benchmark]: CodeCheck took 40212.42 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 830.5 MB). Free memory was 860.5 MB in the beginning and 1.2 GB in the end (delta: -359.8 MB). Peak memory consumption was 470.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,764 INFO L168 Benchmark]: Witness Printer took 124.19 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:46:27,766 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: UNSAFE, OverallTime: 40.0s, OverallIterations: 67, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 134230240 SDtfs, -147254952 SDslu, 872494688 SDs, 0 SdLazy, 353216686 SolverSat, -1546273926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 166.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54315 GetRequests, 53521 SyntacticMatches, 382 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114675 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 8588 NumberOfCodeBlocks, 8588 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 8368 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 58 PerfectInterpolantSequences, 4382/4433 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 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)) [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] 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] 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)) [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] 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] 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)) [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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 589.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2065.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.5 MB in the end (delta: 229.1 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. * CodeCheck took 40212.42 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 830.5 MB). Free memory was 860.5 MB in the beginning and 1.2 GB in the end (delta: -359.8 MB). Peak memory consumption was 470.6 MB. Max. memory is 11.5 GB. * Witness Printer took 124.19 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...