./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 583d1bcfa4b20c513c87cc5240a593897b35ff88 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 18:08:03,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 18:08:03,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 18:08:03,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 18:08:03,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 18:08:03,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 18:08:03,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 18:08:03,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 18:08:03,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 18:08:03,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 18:08:03,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 18:08:03,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 18:08:03,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 18:08:03,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 18:08:03,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 18:08:03,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 18:08:03,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 18:08:03,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 18:08:03,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 18:08:03,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 18:08:03,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 18:08:03,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 18:08:03,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 18:08:03,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 18:08:03,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 18:08:03,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 18:08:03,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 18:08:03,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 18:08:03,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 18:08:03,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 18:08:03,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 18:08:03,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 18:08:03,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 18:08:03,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 18:08:03,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 18:08:03,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 18:08:03,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 18:08:03,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 18:08:03,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 18:08:03,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 18:08:03,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 18:08:03,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 18:08:03,302 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 18:08:03,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 18:08:03,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 18:08:03,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 18:08:03,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 18:08:03,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 18:08:03,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 18:08:03,307 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 18:08:03,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 18:08:03,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 18:08:03,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 18:08:03,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 18:08:03,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 18:08:03,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 18:08:03,310 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 18:08:03,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 18:08:03,311 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 18:08:03,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 18:08:03,311 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 18:08:03,312 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 18:08:03,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 18:08:03,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 18:08:03,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 18:08:03,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 18:08:03,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 18:08:03,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 18:08:03,314 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 18:08:03,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 18:08:03,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 18:08:03,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/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(reach_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 -> 583d1bcfa4b20c513c87cc5240a593897b35ff88 [2020-12-01 18:08:03,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 18:08:03,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 18:08:03,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 18:08:03,731 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 18:08:03,733 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 18:08:03,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2020-12-01 18:08:03,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/data/2b2c5d74d/68ce7e84ad7748268eff375a74bd6274/FLAGd8076b320 [2020-12-01 18:08:04,741 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 18:08:04,742 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2020-12-01 18:08:04,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/data/2b2c5d74d/68ce7e84ad7748268eff375a74bd6274/FLAGd8076b320 [2020-12-01 18:08:04,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/data/2b2c5d74d/68ce7e84ad7748268eff375a74bd6274 [2020-12-01 18:08:04,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 18:08:04,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 18:08:04,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 18:08:04,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 18:08:04,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 18:08:04,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:08:04" (1/1) ... [2020-12-01 18:08:04,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613b3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:04, skipping insertion in model container [2020-12-01 18:08:04,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:08:04" (1/1) ... [2020-12-01 18:08:04,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 18:08:05,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 18:08:05,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:08:05,610 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 18:08:05,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:08:05,773 INFO L208 MainTranslator]: Completed translation [2020-12-01 18:08:05,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05 WrapperNode [2020-12-01 18:08:05,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 18:08:05,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 18:08:05,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 18:08:05,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 18:08:05,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 18:08:05,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 18:08:05,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 18:08:05,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 18:08:05,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:05,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... [2020-12-01 18:08:06,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 18:08:06,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 18:08:06,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 18:08:06,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 18:08:06,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:08:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/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 [2020-12-01 18:08:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 18:08:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 18:08:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 18:08:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 18:08:08,829 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 18:08:08,830 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 18:08:08,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:08:08 BoogieIcfgContainer [2020-12-01 18:08:08,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 18:08:08,835 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 18:08:08,837 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 18:08:08,851 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 18:08:08,851 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:08:08" (1/1) ... [2020-12-01 18:08:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 18:08:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 18:08:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 18:08:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 18:08:08,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2020-12-01 18:08:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2020-12-01 18:08:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 18:08:10,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2020-12-01 18:08:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-12-01 18:08:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 18:08:10,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 151 states and 228 transitions. [2020-12-01 18:08:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2020-12-01 18:08:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 18:08:11,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 221 states and 300 transitions. [2020-12-01 18:08:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2020-12-01 18:08:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-01 18:08:12,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 233 states and 315 transitions. [2020-12-01 18:08:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 315 transitions. [2020-12-01 18:08:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:08:12,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 249 states and 338 transitions. [2020-12-01 18:08:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2020-12-01 18:08:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:08:13,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 254 states and 343 transitions. [2020-12-01 18:08:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 343 transitions. [2020-12-01 18:08:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-01 18:08:13,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 267 states and 358 transitions. [2020-12-01 18:08:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2020-12-01 18:08:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 18:08:14,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 271 states and 362 transitions. [2020-12-01 18:08:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 362 transitions. [2020-12-01 18:08:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 18:08:14,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 282 states and 374 transitions. [2020-12-01 18:08:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 374 transitions. [2020-12-01 18:08:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 18:08:15,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 299 states and 393 transitions. [2020-12-01 18:08:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2020-12-01 18:08:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-01 18:08:15,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 314 states and 413 transitions. [2020-12-01 18:08:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 413 transitions. [2020-12-01 18:08:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 18:08:17,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 316 states and 414 transitions. [2020-12-01 18:08:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 414 transitions. [2020-12-01 18:08:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 18:08:17,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 18:08:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 317 states and 416 transitions. [2020-12-01 18:08:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 416 transitions. [2020-12-01 18:08:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-01 18:08:17,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 320 states and 420 transitions. [2020-12-01 18:08:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 420 transitions. [2020-12-01 18:08:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 18:08:18,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 350 states and 453 transitions. [2020-12-01 18:08:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 453 transitions. [2020-12-01 18:08:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 18:08:19,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 364 states and 467 transitions. [2020-12-01 18:08:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 467 transitions. [2020-12-01 18:08:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 18:08:19,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 367 states and 471 transitions. [2020-12-01 18:08:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 471 transitions. [2020-12-01 18:08:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 18:08:19,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 381 states and 485 transitions. [2020-12-01 18:08:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 485 transitions. [2020-12-01 18:08:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 18:08:20,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 404 states and 509 transitions. [2020-12-01 18:08:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 509 transitions. [2020-12-01 18:08:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 18:08:20,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 444 states and 552 transitions. [2020-12-01 18:08:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 552 transitions. [2020-12-01 18:08:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-01 18:08:21,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:08:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 485 states and 597 transitions. [2020-12-01 18:08:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 597 transitions. [2020-12-01 18:08:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:08:23,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 488 states and 602 transitions. [2020-12-01 18:08:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 602 transitions. [2020-12-01 18:08:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:08:23,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:08:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 493 states and 607 transitions. [2020-12-01 18:08:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 607 transitions. [2020-12-01 18:08:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 18:08:23,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 507 states and 624 transitions. [2020-12-01 18:08:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 624 transitions. [2020-12-01 18:08:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 18:08:24,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 561 states and 697 transitions. [2020-12-01 18:08:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2020-12-01 18:08:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 18:08:26,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 566 states and 702 transitions. [2020-12-01 18:08:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 702 transitions. [2020-12-01 18:08:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-01 18:08:27,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:08:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 571 states and 708 transitions. [2020-12-01 18:08:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 708 transitions. [2020-12-01 18:08:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-01 18:08:27,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 18:08:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 574 states and 711 transitions. [2020-12-01 18:08:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 711 transitions. [2020-12-01 18:08:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 18:08:28,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 18:08:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 577 states and 714 transitions. [2020-12-01 18:08:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 714 transitions. [2020-12-01 18:08:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 18:08:28,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 18:08:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 601 states and 740 transitions. [2020-12-01 18:08:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 740 transitions. [2020-12-01 18:08:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-01 18:08:29,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 18:08:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 619 states and 761 transitions. [2020-12-01 18:08:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 761 transitions. [2020-12-01 18:08:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 18:08:29,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 18:08:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 622 states and 765 transitions. [2020-12-01 18:08:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 765 transitions. [2020-12-01 18:08:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 18:08:30,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:08:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 634 states and 780 transitions. [2020-12-01 18:08:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 780 transitions. [2020-12-01 18:08:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 18:08:31,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 666 states and 815 transitions. [2020-12-01 18:08:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 815 transitions. [2020-12-01 18:08:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:08:31,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 736 states and 892 transitions. [2020-12-01 18:08:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 892 transitions. [2020-12-01 18:08:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 18:08:33,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:08:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 737 states and 894 transitions. [2020-12-01 18:08:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 894 transitions. [2020-12-01 18:08:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 18:08:33,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 806 states and 969 transitions. [2020-12-01 18:08:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 969 transitions. [2020-12-01 18:08:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 18:08:35,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 827 states and 993 transitions. [2020-12-01 18:08:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 993 transitions. [2020-12-01 18:08:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:08:36,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-12-01 18:08:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 828 states and 993 transitions. [2020-12-01 18:08:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 993 transitions. [2020-12-01 18:08:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 18:08:36,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:08:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 856 states and 1023 transitions. [2020-12-01 18:08:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1023 transitions. [2020-12-01 18:08:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 18:08:37,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 927 states and 1094 transitions. [2020-12-01 18:08:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1094 transitions. [2020-12-01 18:08:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-01 18:08:39,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 944 states and 1112 transitions. [2020-12-01 18:08:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1112 transitions. [2020-12-01 18:08:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 18:08:39,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 18:08:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 983 states and 1154 transitions. [2020-12-01 18:08:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1154 transitions. [2020-12-01 18:08:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-12-01 18:08:41,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-01 18:08:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1008 states and 1181 transitions. [2020-12-01 18:08:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1181 transitions. [2020-12-01 18:08:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 18:08:41,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 183 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1092 states and 1275 transitions. [2020-12-01 18:08:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1275 transitions. [2020-12-01 18:08:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 18:08:45,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:08:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1094 states and 1276 transitions. [2020-12-01 18:08:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1276 transitions. [2020-12-01 18:08:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 18:08:46,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1148 states and 1336 transitions. [2020-12-01 18:08:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1336 transitions. [2020-12-01 18:08:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 18:08:48,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:08:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1192 states and 1394 transitions. [2020-12-01 18:08:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1394 transitions. [2020-12-01 18:08:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 18:08:52,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1212 states and 1421 transitions. [2020-12-01 18:08:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1421 transitions. [2020-12-01 18:08:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 18:08:54,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:08:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1223 states and 1433 transitions. [2020-12-01 18:08:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1433 transitions. [2020-12-01 18:08:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 18:08:55,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:08:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:08:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1225 states and 1434 transitions. [2020-12-01 18:08:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1434 transitions. [2020-12-01 18:08:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:08:56,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:08:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:08:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1305 states and 1536 transitions. [2020-12-01 18:09:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1536 transitions. [2020-12-01 18:09:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:01,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1311 states and 1546 transitions. [2020-12-01 18:09:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1546 transitions. [2020-12-01 18:09:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:03,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1322 states and 1561 transitions. [2020-12-01 18:09:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1561 transitions. [2020-12-01 18:09:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:05,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1334 states and 1576 transitions. [2020-12-01 18:09:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1576 transitions. [2020-12-01 18:09:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:06,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-12-01 18:09:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1345 states and 1587 transitions. [2020-12-01 18:09:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1587 transitions. [2020-12-01 18:09:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:08,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-12-01 18:09:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1347 states and 1590 transitions. [2020-12-01 18:09:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1590 transitions. [2020-12-01 18:09:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 18:09:09,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1361 states and 1606 transitions. [2020-12-01 18:09:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1606 transitions. [2020-12-01 18:09:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-01 18:09:10,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-12-01 18:09:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1376 states and 1618 transitions. [2020-12-01 18:09:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1618 transitions. [2020-12-01 18:09:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-01 18:09:10,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 150 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1420 states and 1667 transitions. [2020-12-01 18:09:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1667 transitions. [2020-12-01 18:09:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-01 18:09:16,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-12-01 18:09:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1490 states and 1739 transitions. [2020-12-01 18:09:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1739 transitions. [2020-12-01 18:09:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-01 18:09:17,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:09:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1492 states and 1741 transitions. [2020-12-01 18:09:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1741 transitions. [2020-12-01 18:09:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 18:09:18,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 18:09:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1562 states and 1813 transitions. [2020-12-01 18:09:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1813 transitions. [2020-12-01 18:09:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-01 18:09:20,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 18:09:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1601 states and 1865 transitions. [2020-12-01 18:09:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1865 transitions. [2020-12-01 18:09:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-01 18:09:26,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 18:09:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1617 states and 1889 transitions. [2020-12-01 18:09:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1889 transitions. [2020-12-01 18:09:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-01 18:09:29,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 18:09:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1618 states and 1890 transitions. [2020-12-01 18:09:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1890 transitions. [2020-12-01 18:09:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-01 18:09:30,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 18:09:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1619 states and 1892 transitions. [2020-12-01 18:09:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1892 transitions. [2020-12-01 18:09:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-12-01 18:09:31,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-12-01 18:09:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1665 states and 1948 transitions. [2020-12-01 18:09:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1948 transitions. [2020-12-01 18:09:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 18:09:37,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:09:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1727 states and 2029 transitions. [2020-12-01 18:09:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2029 transitions. [2020-12-01 18:09:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 18:09:44,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:09:47,821 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2020-12-01 18:09:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1750 states and 2053 transitions. [2020-12-01 18:09:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2053 transitions. [2020-12-01 18:09:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 18:09:48,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:09:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1751 states and 2054 transitions. [2020-12-01 18:09:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2054 transitions. [2020-12-01 18:09:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-01 18:09:49,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-01 18:09:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1770 states and 2074 transitions. [2020-12-01 18:09:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2074 transitions. [2020-12-01 18:09:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-01 18:09:54,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:09:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1775 states and 2081 transitions. [2020-12-01 18:09:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2081 transitions. [2020-12-01 18:09:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-12-01 18:09:55,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-12-01 18:09:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:09:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 1788 states and 2093 transitions. [2020-12-01 18:09:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2093 transitions. [2020-12-01 18:09:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-01 18:09:56,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:09:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:09:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:10:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1817 states and 2134 transitions. [2020-12-01 18:10:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2134 transitions. [2020-12-01 18:10:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-01 18:10:07,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:10:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1822 states and 2139 transitions. [2020-12-01 18:10:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2139 transitions. [2020-12-01 18:10:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-01 18:10:10,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 286 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:10:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1839 states and 2156 transitions. [2020-12-01 18:10:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2156 transitions. [2020-12-01 18:10:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 18:10:16,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 18:10:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1891 states and 2224 transitions. [2020-12-01 18:10:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2224 transitions. [2020-12-01 18:10:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 18:10:28,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 18:10:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1908 states and 2243 transitions. [2020-12-01 18:10:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2243 transitions. [2020-12-01 18:10:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 18:10:34,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 18:10:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1926 states and 2262 transitions. [2020-12-01 18:10:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2262 transitions. [2020-12-01 18:10:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 18:10:39,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 18:10:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 1939 states and 2274 transitions. [2020-12-01 18:10:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2274 transitions. [2020-12-01 18:10:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 18:10:41,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 18:10:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 1940 states and 2274 transitions. [2020-12-01 18:10:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2274 transitions. [2020-12-01 18:10:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-12-01 18:10:42,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 315 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 18:10:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1955 states and 2292 transitions. [2020-12-01 18:10:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2292 transitions. [2020-12-01 18:10:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-01 18:10:43,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-01 18:10:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1985 states and 2326 transitions. [2020-12-01 18:10:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2326 transitions. [2020-12-01 18:10:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-01 18:10:46,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-01 18:10:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 1995 states and 2337 transitions. [2020-12-01 18:10:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2337 transitions. [2020-12-01 18:10:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-01 18:10:48,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-01 18:10:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1997 states and 2341 transitions. [2020-12-01 18:10:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2341 transitions. [2020-12-01 18:10:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-01 18:10:49,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:10:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-01 18:10:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:10:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2027 states and 2376 transitions. [2020-12-01 18:10:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2376 transitions. [2020-12-01 18:10:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-01 18:10:53,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:10:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:10:53,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:10:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:10:53,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:10:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:10:54,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:10:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:10:54,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:11:00,318 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 89 iterations. [2020-12-01 18:11:00,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:11:00 ImpRootNode [2020-12-01 18:11:00,609 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 18:11:00,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 18:11:00,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 18:11:00,610 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 18:11:00,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:08:08" (3/4) ... [2020-12-01 18:11:00,617 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 18:11:00,963 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_02a0436d-16a1-4133-aa3d-ef9eabaf9ecc/bin/ukojak/witness.graphml [2020-12-01 18:11:00,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 18:11:00,965 INFO L168 Benchmark]: Toolchain (without parser) took 176020.44 ms. Allocated memory was 90.2 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 60.6 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 285.4 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,965 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 90.2 MB. Free memory is still 50.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 18:11:00,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.15 ms. Allocated memory is still 90.2 MB. Free memory was 60.4 MB in the beginning and 50.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.91 ms. Allocated memory is still 90.2 MB. Free memory was 50.7 MB in the beginning and 45.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,968 INFO L168 Benchmark]: Boogie Preprocessor took 122.21 ms. Allocated memory was 90.2 MB in the beginning and 132.1 MB in the end (delta: 41.9 MB). Free memory was 45.1 MB in the beginning and 105.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,972 INFO L168 Benchmark]: RCFGBuilder took 2810.27 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 95.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,973 INFO L168 Benchmark]: CodeCheck took 171774.03 ms. Allocated memory was 132.1 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 95.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 240.9 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,974 INFO L168 Benchmark]: Witness Printer took 353.85 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-12-01 18:11:00,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 171.4s, OverallIterations: 89, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 873465892 SDtfs, -1509596774 SDslu, 1616959708 SDs, 0 SdLazy, 1881348262 SolverSat, 7798768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 538.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93878 GetRequests, 89661 SyntacticMatches, 3341 SemanticMatches, 876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482591 ImplicationChecksByTransitivity, 132.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.8s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 14589 NumberOfCodeBlocks, 14589 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 14265 ConstructedInterpolants, 0 QuantifiedInterpolants, 10764432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 88 InterpolantComputations, 66 PerfectInterpolantSequences, 12901/13832 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: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label56.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 90.2 MB. Free memory is still 50.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 823.15 ms. Allocated memory is still 90.2 MB. Free memory was 60.4 MB in the beginning and 50.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 123.91 ms. Allocated memory is still 90.2 MB. Free memory was 50.7 MB in the beginning and 45.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 122.21 ms. Allocated memory was 90.2 MB in the beginning and 132.1 MB in the end (delta: 41.9 MB). Free memory was 45.1 MB in the beginning and 105.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2810.27 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 95.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 16.1 GB. * CodeCheck took 171774.03 ms. Allocated memory was 132.1 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 95.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 240.9 MB. Max. memory is 16.1 GB. * Witness Printer took 353.85 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...