./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bef46999e9dea747e943c0e8bab6fd45498a6f2f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:19:04,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:19:04,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:19:04,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:19:04,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:19:04,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:19:04,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:19:04,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:19:04,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:19:04,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:19:04,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:19:04,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:19:04,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:19:04,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:19:04,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:19:04,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:19:04,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:19:04,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:19:04,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:19:04,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:19:04,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:19:04,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:19:04,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:19:04,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:19:04,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:19:04,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:19:04,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:19:04,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:19:04,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:19:04,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:19:04,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:19:04,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:19:04,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:19:04,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:19:04,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:19:04,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:19:04,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:19:04,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:19:04,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:19:04,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:19:04,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:19:04,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 05:19:04,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:19:04,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:19:04,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 05:19:04,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 05:19:04,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:19:04,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:19:04,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:19:04,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:19:04,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:19:04,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:19:04,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:19:04,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:19:04,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:19:04,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:19:04,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:19:04,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:19:04,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:19:04,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:19:04,595 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 05:19:04,595 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 05:19:04,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:19:04,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:19:04,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 05:19:04,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:19:04,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:19:04,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:19:04,600 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 05:19:04,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:19:04,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:19:04,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bef46999e9dea747e943c0e8bab6fd45498a6f2f [2019-11-20 05:19:04,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:19:04,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:19:04,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:19:04,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:19:04,849 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:19:04,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2019-11-20 05:19:04,911 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/data/f0d434673/41a603fa97dc4e20a2d5d4cbfa372040/FLAG9bd24fcb0 [2019-11-20 05:19:05,441 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:19:05,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2019-11-20 05:19:05,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/data/f0d434673/41a603fa97dc4e20a2d5d4cbfa372040/FLAG9bd24fcb0 [2019-11-20 05:19:05,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/data/f0d434673/41a603fa97dc4e20a2d5d4cbfa372040 [2019-11-20 05:19:05,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:19:05,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:19:05,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:19:05,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:19:05,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:19:05,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:05" (1/1) ... [2019-11-20 05:19:05,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edf95a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:05, skipping insertion in model container [2019-11-20 05:19:05,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:19:05" (1/1) ... [2019-11-20 05:19:05,751 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:19:05,820 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:19:06,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:19:06,434 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:19:06,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:19:06,596 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:19:06,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06 WrapperNode [2019-11-20 05:19:06,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:19:06,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:19:06,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:19:06,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:19:06,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:19:06,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:19:06,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:19:06,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:19:06,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... [2019-11-20 05:19:06,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:19:06,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:19:06,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:19:06,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:19:06,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:19:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 05:19:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:19:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:19:09,459 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:19:09,460 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:19:09,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:09 BoogieIcfgContainer [2019-11-20 05:19:09,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:19:09,463 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 05:19:09,463 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 05:19:09,477 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 05:19:09,480 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:09" (1/1) ... [2019-11-20 05:19:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:19:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-20 05:19:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-20 05:19:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 05:19:09,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2019-11-20 05:19:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2019-11-20 05:19:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 05:19:10,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 215 states and 313 transitions. [2019-11-20 05:19:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 313 transitions. [2019-11-20 05:19:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:19:12,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 220 states and 323 transitions. [2019-11-20 05:19:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2019-11-20 05:19:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:19:12,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 289 states and 395 transitions. [2019-11-20 05:19:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2019-11-20 05:19:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:19:13,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 292 states and 399 transitions. [2019-11-20 05:19:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 399 transitions. [2019-11-20 05:19:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 05:19:13,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 303 states and 415 transitions. [2019-11-20 05:19:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 415 transitions. [2019-11-20 05:19:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:19:14,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 304 states and 417 transitions. [2019-11-20 05:19:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2019-11-20 05:19:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:19:14,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 316 states and 434 transitions. [2019-11-20 05:19:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 434 transitions. [2019-11-20 05:19:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:15,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 330 states and 454 transitions. [2019-11-20 05:19:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 454 transitions. [2019-11-20 05:19:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 05:19:16,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 331 states and 456 transitions. [2019-11-20 05:19:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 456 transitions. [2019-11-20 05:19:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:19:16,641 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 332 states and 458 transitions. [2019-11-20 05:19:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 458 transitions. [2019-11-20 05:19:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 05:19:16,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 343 states and 470 transitions. [2019-11-20 05:19:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 470 transitions. [2019-11-20 05:19:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:19:17,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 05:19:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 356 states and 486 transitions. [2019-11-20 05:19:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 486 transitions. [2019-11-20 05:19:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 05:19:18,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 374 states and 509 transitions. [2019-11-20 05:19:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 509 transitions. [2019-11-20 05:19:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 05:19:19,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 384 states and 521 transitions. [2019-11-20 05:19:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2019-11-20 05:19:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 05:19:19,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 385 states and 522 transitions. [2019-11-20 05:19:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 522 transitions. [2019-11-20 05:19:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 05:19:19,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 392 states and 530 transitions. [2019-11-20 05:19:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 530 transitions. [2019-11-20 05:19:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 05:19:20,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 394 states and 531 transitions. [2019-11-20 05:19:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 531 transitions. [2019-11-20 05:19:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 05:19:20,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 409 states and 550 transitions. [2019-11-20 05:19:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 550 transitions. [2019-11-20 05:19:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 05:19:21,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:19:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 422 states and 568 transitions. [2019-11-20 05:19:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 568 transitions. [2019-11-20 05:19:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 05:19:22,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 423 states and 570 transitions. [2019-11-20 05:19:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 570 transitions. [2019-11-20 05:19:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 05:19:22,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 431 states and 579 transitions. [2019-11-20 05:19:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 579 transitions. [2019-11-20 05:19:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 05:19:22,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 432 states and 581 transitions. [2019-11-20 05:19:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 581 transitions. [2019-11-20 05:19:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 05:19:22,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 449 states and 599 transitions. [2019-11-20 05:19:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 599 transitions. [2019-11-20 05:19:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 05:19:23,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:19:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 450 states and 601 transitions. [2019-11-20 05:19:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 601 transitions. [2019-11-20 05:19:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 05:19:24,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 451 states and 603 transitions. [2019-11-20 05:19:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 603 transitions. [2019-11-20 05:19:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 05:19:24,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 05:19:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 453 states and 605 transitions. [2019-11-20 05:19:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 605 transitions. [2019-11-20 05:19:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 05:19:24,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:19:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 458 states and 610 transitions. [2019-11-20 05:19:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 610 transitions. [2019-11-20 05:19:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 05:19:24,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 475 states and 629 transitions. [2019-11-20 05:19:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 629 transitions. [2019-11-20 05:19:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 05:19:25,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 486 states and 639 transitions. [2019-11-20 05:19:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 639 transitions. [2019-11-20 05:19:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 05:19:26,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 05:19:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 491 states and 644 transitions. [2019-11-20 05:19:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 644 transitions. [2019-11-20 05:19:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 05:19:26,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 500 states and 653 transitions. [2019-11-20 05:19:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 653 transitions. [2019-11-20 05:19:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 05:19:27,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 05:19:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 501 states and 654 transitions. [2019-11-20 05:19:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 654 transitions. [2019-11-20 05:19:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 05:19:27,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 528 states and 690 transitions. [2019-11-20 05:19:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 690 transitions. [2019-11-20 05:19:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 05:19:29,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2019-11-20 05:19:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2019-11-20 05:19:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 05:19:29,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 05:19:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 539 states and 701 transitions. [2019-11-20 05:19:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 701 transitions. [2019-11-20 05:19:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 05:19:29,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:19:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2019-11-20 05:19:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2019-11-20 05:19:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 05:19:29,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:19:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2019-11-20 05:19:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2019-11-20 05:19:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 05:19:29,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:31,806 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-11-20 05:19:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 579 states and 749 transitions. [2019-11-20 05:19:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 749 transitions. [2019-11-20 05:19:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:19:32,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 597 states and 778 transitions. [2019-11-20 05:19:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 778 transitions. [2019-11-20 05:19:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:19:35,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 600 states and 782 transitions. [2019-11-20 05:19:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 782 transitions. [2019-11-20 05:19:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:19:35,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 605 states and 787 transitions. [2019-11-20 05:19:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 787 transitions. [2019-11-20 05:19:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 05:19:36,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 610 states and 802 transitions. [2019-11-20 05:19:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 802 transitions. [2019-11-20 05:19:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 05:19:37,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 615 states and 809 transitions. [2019-11-20 05:19:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 809 transitions. [2019-11-20 05:19:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 05:19:37,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:19:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 623 states and 818 transitions. [2019-11-20 05:19:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 818 transitions. [2019-11-20 05:19:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 05:19:38,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 636 states and 831 transitions. [2019-11-20 05:19:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 831 transitions. [2019-11-20 05:19:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 05:19:38,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 645 states and 840 transitions. [2019-11-20 05:19:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 840 transitions. [2019-11-20 05:19:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 05:19:38,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:19:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 654 states and 860 transitions. [2019-11-20 05:19:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 860 transitions. [2019-11-20 05:19:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 05:19:42,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:19:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 655 states and 861 transitions. [2019-11-20 05:19:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 861 transitions. [2019-11-20 05:19:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 05:19:42,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:19:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 668 states and 874 transitions. [2019-11-20 05:19:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 874 transitions. [2019-11-20 05:19:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 05:19:42,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:19:45,843 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-11-20 05:19:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 716 states and 929 transitions. [2019-11-20 05:19:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 929 transitions. [2019-11-20 05:19:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 05:19:47,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:19:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 762 states and 989 transitions. [2019-11-20 05:19:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 989 transitions. [2019-11-20 05:19:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 05:19:54,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:19:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 774 states and 1001 transitions. [2019-11-20 05:19:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1001 transitions. [2019-11-20 05:19:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 05:19:56,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:20:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 819 states and 1056 transitions. [2019-11-20 05:20:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1056 transitions. [2019-11-20 05:20:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 05:20:00,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:20:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 857 states and 1093 transitions. [2019-11-20 05:20:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1093 transitions. [2019-11-20 05:20:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 05:20:03,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 867 states and 1108 transitions. [2019-11-20 05:20:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1108 transitions. [2019-11-20 05:20:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 05:20:06,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 884 states and 1125 transitions. [2019-11-20 05:20:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1125 transitions. [2019-11-20 05:20:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 05:20:07,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:20:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 889 states and 1133 transitions. [2019-11-20 05:20:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1133 transitions. [2019-11-20 05:20:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 05:20:07,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:20:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 901 states and 1146 transitions. [2019-11-20 05:20:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1146 transitions. [2019-11-20 05:20:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 05:20:07,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:20:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 910 states and 1158 transitions. [2019-11-20 05:20:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1158 transitions. [2019-11-20 05:20:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 05:20:08,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 977 states and 1230 transitions. [2019-11-20 05:20:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1230 transitions. [2019-11-20 05:20:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 05:20:16,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:20:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 981 states and 1234 transitions. [2019-11-20 05:20:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1234 transitions. [2019-11-20 05:20:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 05:20:17,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 05:20:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1007 states and 1263 transitions. [2019-11-20 05:20:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1263 transitions. [2019-11-20 05:20:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 05:20:19,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 05:20:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1018 states and 1273 transitions. [2019-11-20 05:20:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1273 transitions. [2019-11-20 05:20:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 05:20:20,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 05:20:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1035 states and 1291 transitions. [2019-11-20 05:20:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1291 transitions. [2019-11-20 05:20:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 05:20:21,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1106 states and 1362 transitions. [2019-11-20 05:20:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1362 transitions. [2019-11-20 05:20:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 05:20:23,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 05:20:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1111 states and 1376 transitions. [2019-11-20 05:20:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1376 transitions. [2019-11-20 05:20:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 05:20:26,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 05:20:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1119 states and 1384 transitions. [2019-11-20 05:20:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1384 transitions. [2019-11-20 05:20:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 05:20:27,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1126 states and 1396 transitions. [2019-11-20 05:20:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1396 transitions. [2019-11-20 05:20:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 05:20:29,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1149 states and 1424 transitions. [2019-11-20 05:20:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1424 transitions. [2019-11-20 05:20:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 05:20:33,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1167 states and 1445 transitions. [2019-11-20 05:20:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1445 transitions. [2019-11-20 05:20:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 05:20:35,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1169 states and 1446 transitions. [2019-11-20 05:20:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1446 transitions. [2019-11-20 05:20:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 05:20:36,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:20:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1177 states and 1457 transitions. [2019-11-20 05:20:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1457 transitions. [2019-11-20 05:20:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 05:20:38,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:20:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1210 states and 1499 transitions. [2019-11-20 05:20:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1499 transitions. [2019-11-20 05:20:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 05:20:41,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1225 states and 1520 transitions. [2019-11-20 05:20:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1520 transitions. [2019-11-20 05:20:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 05:20:44,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:20:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1242 states and 1537 transitions. [2019-11-20 05:20:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1537 transitions. [2019-11-20 05:20:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 05:20:46,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 05:20:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1243 states and 1539 transitions. [2019-11-20 05:20:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1539 transitions. [2019-11-20 05:20:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 05:20:47,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 05:20:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1247 states and 1548 transitions. [2019-11-20 05:20:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1548 transitions. [2019-11-20 05:20:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 05:20:49,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1282 states and 1595 transitions. [2019-11-20 05:20:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1595 transitions. [2019-11-20 05:20:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 05:20:58,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1284 states and 1600 transitions. [2019-11-20 05:20:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1600 transitions. [2019-11-20 05:20:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 05:20:59,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 05:21:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1309 states and 1629 transitions. [2019-11-20 05:21:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1629 transitions. [2019-11-20 05:21:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:02,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-20 05:21:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1310 states and 1630 transitions. [2019-11-20 05:21:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1630 transitions. [2019-11-20 05:21:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:02,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1333 states and 1663 transitions. [2019-11-20 05:21:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1663 transitions. [2019-11-20 05:21:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:09,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1347 states and 1678 transitions. [2019-11-20 05:21:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1678 transitions. [2019-11-20 05:21:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:12,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1349 states and 1680 transitions. [2019-11-20 05:21:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1680 transitions. [2019-11-20 05:21:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:13,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1360 states and 1691 transitions. [2019-11-20 05:21:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1691 transitions. [2019-11-20 05:21:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:21:14,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1362 states and 1692 transitions. [2019-11-20 05:21:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1692 transitions. [2019-11-20 05:21:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 05:21:15,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1428 states and 1771 transitions. [2019-11-20 05:21:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1771 transitions. [2019-11-20 05:21:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 05:21:21,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1445 states and 1789 transitions. [2019-11-20 05:21:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1789 transitions. [2019-11-20 05:21:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 05:21:25,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 05:21:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1449 states and 1794 transitions. [2019-11-20 05:21:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1794 transitions. [2019-11-20 05:21:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 05:21:26,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 05:21:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1453 states and 1799 transitions. [2019-11-20 05:21:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1799 transitions. [2019-11-20 05:21:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 05:21:28,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 05:21:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1464 states and 1811 transitions. [2019-11-20 05:21:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1811 transitions. [2019-11-20 05:21:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 05:21:29,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 05:21:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1465 states and 1811 transitions. [2019-11-20 05:21:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1811 transitions. [2019-11-20 05:21:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 05:21:29,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 05:21:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1488 states and 1836 transitions. [2019-11-20 05:21:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1836 transitions. [2019-11-20 05:21:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:21:34,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 05:21:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1519 states and 1870 transitions. [2019-11-20 05:21:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1870 transitions. [2019-11-20 05:21:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:21:42,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 05:21:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1536 states and 1888 transitions. [2019-11-20 05:21:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1888 transitions. [2019-11-20 05:21:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 05:21:44,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1543 states and 1900 transitions. [2019-11-20 05:21:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1900 transitions. [2019-11-20 05:21:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 05:21:48,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1552 states and 1910 transitions. [2019-11-20 05:21:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1910 transitions. [2019-11-20 05:21:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 05:21:52,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 05:21:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1553 states and 1910 transitions. [2019-11-20 05:21:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1910 transitions. [2019-11-20 05:21:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 05:21:54,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 190 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:21:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1580 states and 1940 transitions. [2019-11-20 05:21:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1940 transitions. [2019-11-20 05:21:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 05:21:57,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 190 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 05:21:57,418 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-20 05:21:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:21:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1581 states and 1944 transitions. [2019-11-20 05:21:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1944 transitions. [2019-11-20 05:21:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 05:21:57,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:21:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:22:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:22:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1600 states and 1964 transitions. [2019-11-20 05:22:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1964 transitions. [2019-11-20 05:22:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:22:02,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:22:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:22:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 05:22:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:22:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1604 states and 1968 transitions. [2019-11-20 05:22:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1968 transitions. [2019-11-20 05:22:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 05:22:03,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:22:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:22:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-20 05:22:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:22:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1609 states and 1975 transitions. [2019-11-20 05:22:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1975 transitions. [2019-11-20 05:22:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 05:22:03,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:22:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:22:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:22:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:22:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:22:04,293 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 105 iterations. [2019-11-20 05:22:04,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 05:22:04 ImpRootNode [2019-11-20 05:22:04,614 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 05:22:04,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:22:04,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:22:04,615 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:22:04,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:19:09" (3/4) ... [2019-11-20 05:22:04,618 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:22:04,801 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2ba6252e-8ea8-47d3-b594-7d88f70f9ff7/bin/ukojak/witness.graphml [2019-11-20 05:22:04,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:22:04,803 INFO L168 Benchmark]: Toolchain (without parser) took 179070.49 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -287.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,803 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:22:04,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,805 INFO L168 Benchmark]: Boogie Preprocessor took 62.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,805 INFO L168 Benchmark]: RCFGBuilder took 2710.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.4 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,806 INFO L168 Benchmark]: CodeCheck took 175151.40 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 895.4 MB in the beginning and 1.3 GB in the end (delta: -383.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,806 INFO L168 Benchmark]: Witness Printer took 186.53 ms. Allocated memory is still 3.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:22:04,808 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 174.7s, OverallIterations: 105, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -938966436 SDtfs, -1124650810 SDslu, 46322200 SDs, 0 SdLazy, -586111804 SolverSat, 2101292278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 524.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93248 GetRequests, 89867 SyntacticMatches, 2299 SemanticMatches, 1082 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849540 ImplicationChecksByTransitivity, 151.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 14142 NumberOfCodeBlocks, 14142 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 13839 ConstructedInterpolants, 0 QuantifiedInterpolants, 9744793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 104 InterpolantComputations, 81 PerfectInterpolantSequences, 9428/9731 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: 413]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND TRUE ((((((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)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, 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] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !(((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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !((((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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !(((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=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 !((((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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !((!(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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=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 !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, 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] [L412] 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=1, 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] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 863.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2710.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.4 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * CodeCheck took 175151.40 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 895.4 MB in the beginning and 1.3 GB in the end (delta: -383.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 186.53 ms. Allocated memory is still 3.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...