./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf0249cfb5937fa99dbdd7cccb8445a256379951 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 18:20:23,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 18:20:23,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 18:20:24,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 18:20:24,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 18:20:24,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 18:20:24,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 18:20:24,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 18:20:24,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 18:20:24,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 18:20:24,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 18:20:24,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 18:20:24,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 18:20:24,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 18:20:24,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 18:20:24,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 18:20:24,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 18:20:24,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 18:20:24,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 18:20:24,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 18:20:24,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 18:20:24,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 18:20:24,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 18:20:24,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 18:20:24,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 18:20:24,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 18:20:24,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 18:20:24,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 18:20:24,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 18:20:24,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 18:20:24,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 18:20:24,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 18:20:24,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 18:20:24,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 18:20:24,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 18:20:24,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 18:20:24,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 18:20:24,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 18:20:24,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 18:20:24,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 18:20:24,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 18:20:24,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 18:20:24,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 18:20:24,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 18:20:24,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 18:20:24,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 18:20:24,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 18:20:24,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 18:20:24,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 18:20:24,128 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 18:20:24,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 18:20:24,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 18:20:24,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 18:20:24,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 18:20:24,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 18:20:24,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 18:20:24,130 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 18:20:24,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 18:20:24,130 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 18:20:24,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 18:20:24,131 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 18:20:24,131 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 18:20:24,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 18:20:24,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 18:20:24,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 18:20:24,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 18:20:24,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 18:20:24,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 18:20:24,134 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 18:20:24,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 18:20:24,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 18:20:24,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf0249cfb5937fa99dbdd7cccb8445a256379951 [2020-12-01 18:20:24,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 18:20:24,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 18:20:24,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 18:20:24,463 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 18:20:24,465 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 18:20:24,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2020-12-01 18:20:24,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/data/d6eb9cd3b/65dca2ba3ece48a3ad5144b4738b4231/FLAGe68bbab75 [2020-12-01 18:20:25,396 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 18:20:25,397 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2020-12-01 18:20:25,414 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/data/d6eb9cd3b/65dca2ba3ece48a3ad5144b4738b4231/FLAGe68bbab75 [2020-12-01 18:20:25,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/data/d6eb9cd3b/65dca2ba3ece48a3ad5144b4738b4231 [2020-12-01 18:20:25,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 18:20:25,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 18:20:25,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 18:20:25,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 18:20:25,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 18:20:25,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:20:25" (1/1) ... [2020-12-01 18:20:25,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109fc593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:25, skipping insertion in model container [2020-12-01 18:20:25,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:20:25" (1/1) ... [2020-12-01 18:20:25,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 18:20:25,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 18:20:26,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:20:26,232 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 18:20:26,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:20:26,449 INFO L208 MainTranslator]: Completed translation [2020-12-01 18:20:26,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26 WrapperNode [2020-12-01 18:20:26,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 18:20:26,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 18:20:26,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 18:20:26,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 18:20:26,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 18:20:26,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 18:20:26,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 18:20:26,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 18:20:26,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... [2020-12-01 18:20:26,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 18:20:26,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 18:20:26,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 18:20:26,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 18:20:26,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:20:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 18:20:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 18:20:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 18:20:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 18:20:26,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 18:20:29,584 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 18:20:29,584 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 18:20:29,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:20:29 BoogieIcfgContainer [2020-12-01 18:20:29,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 18:20:29,589 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 18:20:29,590 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 18:20:29,603 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 18:20:29,604 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:20:29" (1/1) ... [2020-12-01 18:20:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 18:20:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 18:20:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 18:20:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 18:20:29,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2020-12-01 18:20:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2020-12-01 18:20:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 18:20:30,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2020-12-01 18:20:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2020-12-01 18:20:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 18:20:31,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 151 states and 247 transitions. [2020-12-01 18:20:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 247 transitions. [2020-12-01 18:20:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 18:20:31,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:20:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 227 states and 328 transitions. [2020-12-01 18:20:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2020-12-01 18:20:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-01 18:20:32,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 239 states and 344 transitions. [2020-12-01 18:20:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 344 transitions. [2020-12-01 18:20:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:20:33,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 246 states and 354 transitions. [2020-12-01 18:20:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 354 transitions. [2020-12-01 18:20:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:20:33,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 252 states and 361 transitions. [2020-12-01 18:20:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2020-12-01 18:20:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:20:33,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 257 states and 366 transitions. [2020-12-01 18:20:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 366 transitions. [2020-12-01 18:20:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-01 18:20:34,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 270 states and 381 transitions. [2020-12-01 18:20:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 381 transitions. [2020-12-01 18:20:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-01 18:20:34,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 290 states and 407 transitions. [2020-12-01 18:20:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 407 transitions. [2020-12-01 18:20:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-01 18:20:35,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 303 states and 423 transitions. [2020-12-01 18:20:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 423 transitions. [2020-12-01 18:20:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-01 18:20:36,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 308 states and 428 transitions. [2020-12-01 18:20:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 428 transitions. [2020-12-01 18:20:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-01 18:20:36,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 320 states and 442 transitions. [2020-12-01 18:20:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2020-12-01 18:20:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 18:20:36,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 324 states and 446 transitions. [2020-12-01 18:20:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 446 transitions. [2020-12-01 18:20:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 18:20:37,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 332 states and 454 transitions. [2020-12-01 18:20:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 454 transitions. [2020-12-01 18:20:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-01 18:20:37,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 346 states and 471 transitions. [2020-12-01 18:20:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 471 transitions. [2020-12-01 18:20:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-01 18:20:38,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 348 states and 473 transitions. [2020-12-01 18:20:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 473 transitions. [2020-12-01 18:20:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-01 18:20:38,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 362 states and 489 transitions. [2020-12-01 18:20:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 489 transitions. [2020-12-01 18:20:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 18:20:39,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 18:20:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 363 states and 490 transitions. [2020-12-01 18:20:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 490 transitions. [2020-12-01 18:20:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-01 18:20:39,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 378 states and 508 transitions. [2020-12-01 18:20:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 508 transitions. [2020-12-01 18:20:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-01 18:20:40,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 407 states and 541 transitions. [2020-12-01 18:20:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 541 transitions. [2020-12-01 18:20:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-01 18:20:41,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 426 states and 564 transitions. [2020-12-01 18:20:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 564 transitions. [2020-12-01 18:20:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-01 18:20:42,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 464 states and 619 transitions. [2020-12-01 18:20:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 619 transitions. [2020-12-01 18:20:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-01 18:20:43,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 476 states and 633 transitions. [2020-12-01 18:20:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 633 transitions. [2020-12-01 18:20:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 18:20:44,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 515 states and 681 transitions. [2020-12-01 18:20:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2020-12-01 18:20:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 18:20:45,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 543 states and 712 transitions. [2020-12-01 18:20:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 712 transitions. [2020-12-01 18:20:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 18:20:46,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 559 states and 732 transitions. [2020-12-01 18:20:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 732 transitions. [2020-12-01 18:20:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 18:20:46,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 573 states and 747 transitions. [2020-12-01 18:20:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 747 transitions. [2020-12-01 18:20:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 18:20:47,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 18:20:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 574 states and 748 transitions. [2020-12-01 18:20:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 748 transitions. [2020-12-01 18:20:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 18:20:47,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 18:20:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 575 states and 749 transitions. [2020-12-01 18:20:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 749 transitions. [2020-12-01 18:20:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 18:20:47,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:20:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 583 states and 757 transitions. [2020-12-01 18:20:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 757 transitions. [2020-12-01 18:20:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-01 18:20:48,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 18:20:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 584 states and 758 transitions. [2020-12-01 18:20:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 758 transitions. [2020-12-01 18:20:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-01 18:20:48,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:20:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 597 states and 772 transitions. [2020-12-01 18:20:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 772 transitions. [2020-12-01 18:20:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:20:48,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2020-12-01 18:20:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2020-12-01 18:20:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:20:48,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 604 states and 782 transitions. [2020-12-01 18:20:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 782 transitions. [2020-12-01 18:20:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:20:49,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 609 states and 787 transitions. [2020-12-01 18:20:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 787 transitions. [2020-12-01 18:20:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:20:49,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 633 states and 813 transitions. [2020-12-01 18:20:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 813 transitions. [2020-12-01 18:20:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 18:20:50,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 652 states and 835 transitions. [2020-12-01 18:20:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 835 transitions. [2020-12-01 18:20:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 18:20:51,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 661 states and 843 transitions. [2020-12-01 18:20:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2020-12-01 18:20:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-01 18:20:52,089 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 666 states and 850 transitions. [2020-12-01 18:20:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 850 transitions. [2020-12-01 18:20:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 18:20:52,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 701 states and 888 transitions. [2020-12-01 18:20:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 888 transitions. [2020-12-01 18:20:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 18:20:53,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:20:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 706 states and 894 transitions. [2020-12-01 18:20:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 894 transitions. [2020-12-01 18:20:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 18:20:53,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 18:20:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 729 states and 920 transitions. [2020-12-01 18:20:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 920 transitions. [2020-12-01 18:20:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 18:20:54,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 18:20:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 734 states and 925 transitions. [2020-12-01 18:20:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 925 transitions. [2020-12-01 18:20:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 18:20:54,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:20:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 804 states and 997 transitions. [2020-12-01 18:20:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 997 transitions. [2020-12-01 18:20:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:20:55,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 18:20:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 842 states and 1044 transitions. [2020-12-01 18:20:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1044 transitions. [2020-12-01 18:20:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:20:56,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 18:20:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 866 states and 1069 transitions. [2020-12-01 18:20:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1069 transitions. [2020-12-01 18:20:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:20:57,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 18:20:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:20:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 871 states and 1074 transitions. [2020-12-01 18:20:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1074 transitions. [2020-12-01 18:20:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:20:58,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:20:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:20:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:21:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1011 states and 1225 transitions. [2020-12-01 18:21:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1225 transitions. [2020-12-01 18:21:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:21:01,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:21:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1023 states and 1239 transitions. [2020-12-01 18:21:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1239 transitions. [2020-12-01 18:21:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:21:02,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:21:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1029 states and 1246 transitions. [2020-12-01 18:21:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1246 transitions. [2020-12-01 18:21:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:21:02,745 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 18:21:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1030 states and 1246 transitions. [2020-12-01 18:21:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1246 transitions. [2020-12-01 18:21:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:21:02,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:21:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1035 states and 1251 transitions. [2020-12-01 18:21:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1251 transitions. [2020-12-01 18:21:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 18:21:03,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:21:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1106 states and 1322 transitions. [2020-12-01 18:21:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1322 transitions. [2020-12-01 18:21:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 18:21:05,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1110 states and 1326 transitions. [2020-12-01 18:21:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1326 transitions. [2020-12-01 18:21:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 18:21:05,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1120 states and 1337 transitions. [2020-12-01 18:21:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1337 transitions. [2020-12-01 18:21:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-01 18:21:05,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 18:21:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1171 states and 1396 transitions. [2020-12-01 18:21:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1396 transitions. [2020-12-01 18:21:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 18:21:07,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 18:21:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1188 states and 1416 transitions. [2020-12-01 18:21:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1416 transitions. [2020-12-01 18:21:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 18:21:08,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 18:21:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1189 states and 1417 transitions. [2020-12-01 18:21:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1417 transitions. [2020-12-01 18:21:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-01 18:21:09,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1216 states and 1448 transitions. [2020-12-01 18:21:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1448 transitions. [2020-12-01 18:21:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-01 18:21:10,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1221 states and 1452 transitions. [2020-12-01 18:21:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1452 transitions. [2020-12-01 18:21:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 18:21:11,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-01 18:21:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1250 states and 1488 transitions. [2020-12-01 18:21:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1488 transitions. [2020-12-01 18:21:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 18:21:12,983 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-01 18:21:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1258 states and 1495 transitions. [2020-12-01 18:21:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1495 transitions. [2020-12-01 18:21:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 18:21:13,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-01 18:21:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1260 states and 1496 transitions. [2020-12-01 18:21:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1496 transitions. [2020-12-01 18:21:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-12-01 18:21:13,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1288 states and 1525 transitions. [2020-12-01 18:21:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1525 transitions. [2020-12-01 18:21:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-12-01 18:21:15,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 18:21:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1291 states and 1528 transitions. [2020-12-01 18:21:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1528 transitions. [2020-12-01 18:21:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-01 18:21:16,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:21:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1316 states and 1554 transitions. [2020-12-01 18:21:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1554 transitions. [2020-12-01 18:21:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-01 18:21:17,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-01 18:21:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1321 states and 1558 transitions. [2020-12-01 18:21:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1558 transitions. [2020-12-01 18:21:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 18:21:18,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1342 states and 1593 transitions. [2020-12-01 18:21:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1593 transitions. [2020-12-01 18:21:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 18:21:19,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1347 states and 1598 transitions. [2020-12-01 18:21:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1598 transitions. [2020-12-01 18:21:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 18:21:20,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1355 states and 1606 transitions. [2020-12-01 18:21:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1606 transitions. [2020-12-01 18:21:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-01 18:21:20,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 18:21:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1357 states and 1608 transitions. [2020-12-01 18:21:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1608 transitions. [2020-12-01 18:21:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-12-01 18:21:21,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 215 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1444 states and 1707 transitions. [2020-12-01 18:21:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1707 transitions. [2020-12-01 18:21:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-01 18:21:26,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-12-01 18:21:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1470 states and 1735 transitions. [2020-12-01 18:21:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1735 transitions. [2020-12-01 18:21:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-01 18:21:27,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 18:21:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1515 states and 1803 transitions. [2020-12-01 18:21:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1803 transitions. [2020-12-01 18:21:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-01 18:21:31,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 18:21:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1530 states and 1822 transitions. [2020-12-01 18:21:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1822 transitions. [2020-12-01 18:21:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-01 18:21:32,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 18:21:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1540 states and 1832 transitions. [2020-12-01 18:21:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1832 transitions. [2020-12-01 18:21:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 18:21:33,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-01 18:21:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1565 states and 1857 transitions. [2020-12-01 18:21:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1857 transitions. [2020-12-01 18:21:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 18:21:34,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-01 18:21:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1569 states and 1860 transitions. [2020-12-01 18:21:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1860 transitions. [2020-12-01 18:21:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 18:21:34,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-01 18:21:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1604 states and 1895 transitions. [2020-12-01 18:21:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1895 transitions. [2020-12-01 18:21:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 18:21:35,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-01 18:21:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1614 states and 1904 transitions. [2020-12-01 18:21:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1904 transitions. [2020-12-01 18:21:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-01 18:21:36,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-12-01 18:21:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1621 states and 1912 transitions. [2020-12-01 18:21:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1912 transitions. [2020-12-01 18:21:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-01 18:21:37,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 18:21:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1625 states and 1915 transitions. [2020-12-01 18:21:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1915 transitions. [2020-12-01 18:21:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-12-01 18:21:37,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1656 states and 1951 transitions. [2020-12-01 18:21:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1951 transitions. [2020-12-01 18:21:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-12-01 18:21:39,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1669 states and 1966 transitions. [2020-12-01 18:21:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1966 transitions. [2020-12-01 18:21:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-12-01 18:21:41,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1674 states and 1970 transitions. [2020-12-01 18:21:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1970 transitions. [2020-12-01 18:21:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 18:21:42,266 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-01 18:21:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1694 states and 1993 transitions. [2020-12-01 18:21:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1993 transitions. [2020-12-01 18:21:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 18:21:44,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-01 18:21:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1712 states and 2013 transitions. [2020-12-01 18:21:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2013 transitions. [2020-12-01 18:21:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 18:21:46,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-01 18:21:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1717 states and 2017 transitions. [2020-12-01 18:21:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2017 transitions. [2020-12-01 18:21:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-01 18:21:47,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 170 proven. 45 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 18:21:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1769 states and 2094 transitions. [2020-12-01 18:21:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2094 transitions. [2020-12-01 18:21:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-01 18:21:51,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 170 proven. 45 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 18:21:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1789 states and 2112 transitions. [2020-12-01 18:21:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2112 transitions. [2020-12-01 18:21:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-01 18:21:53,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1815 states and 2141 transitions. [2020-12-01 18:21:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2141 transitions. [2020-12-01 18:21:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-01 18:21:57,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:21:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1825 states and 2150 transitions. [2020-12-01 18:21:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2150 transitions. [2020-12-01 18:21:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-12-01 18:21:58,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-01 18:21:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1826 states and 2150 transitions. [2020-12-01 18:21:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2150 transitions. [2020-12-01 18:21:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-01 18:21:58,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-12-01 18:21:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:21:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 1830 states and 2153 transitions. [2020-12-01 18:21:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2153 transitions. [2020-12-01 18:21:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-01 18:21:59,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:21:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:21:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 18:22:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1831 states and 2155 transitions. [2020-12-01 18:22:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2155 transitions. [2020-12-01 18:22:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-01 18:22:00,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-12-01 18:22:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1851 states and 2174 transitions. [2020-12-01 18:22:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2174 transitions. [2020-12-01 18:22:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-12-01 18:22:00,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-01 18:22:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1860 states and 2183 transitions. [2020-12-01 18:22:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2183 transitions. [2020-12-01 18:22:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-12-01 18:22:01,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-01 18:22:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 1864 states and 2186 transitions. [2020-12-01 18:22:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2186 transitions. [2020-12-01 18:22:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-01 18:22:02,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-01 18:22:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 1883 states and 2209 transitions. [2020-12-01 18:22:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2209 transitions. [2020-12-01 18:22:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-01 18:22:04,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-01 18:22:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 1884 states and 2210 transitions. [2020-12-01 18:22:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2210 transitions. [2020-12-01 18:22:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-01 18:22:05,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-01 18:22:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 1888 states and 2213 transitions. [2020-12-01 18:22:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2213 transitions. [2020-12-01 18:22:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-01 18:22:06,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-01 18:22:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1897 states and 2222 transitions. [2020-12-01 18:22:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2222 transitions. [2020-12-01 18:22:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 18:22:07,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 169 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:22:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 1993 states and 2334 transitions. [2020-12-01 18:22:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2334 transitions. [2020-12-01 18:22:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 18:22:20,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 169 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:22:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2013 states and 2353 transitions. [2020-12-01 18:22:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2353 transitions. [2020-12-01 18:22:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 18:22:23,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 169 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:22:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2028 states and 2370 transitions. [2020-12-01 18:22:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2370 transitions. [2020-12-01 18:22:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 18:22:26,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 169 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 18:22:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2037 states and 2379 transitions. [2020-12-01 18:22:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2379 transitions. [2020-12-01 18:22:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 18:22:27,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 18:22:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2039 states and 2381 transitions. [2020-12-01 18:22:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2381 transitions. [2020-12-01 18:22:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-01 18:22:28,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:22:41,847 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 18:22:42,951 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 18:22:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2121 states and 2491 transitions. [2020-12-01 18:22:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2491 transitions. [2020-12-01 18:22:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-01 18:22:49,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:22:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2136 states and 2506 transitions. [2020-12-01 18:22:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2506 transitions. [2020-12-01 18:22:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-01 18:22:53,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:22:57,126 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-01 18:22:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:22:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2157 states and 2529 transitions. [2020-12-01 18:22:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2529 transitions. [2020-12-01 18:22:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-01 18:22:59,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:22:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:22:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:23:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2179 states and 2556 transitions. [2020-12-01 18:23:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2556 transitions. [2020-12-01 18:23:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-12-01 18:23:03,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2020-12-01 18:23:05,855 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-01 18:23:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2234 states and 2614 transitions. [2020-12-01 18:23:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2614 transitions. [2020-12-01 18:23:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-12-01 18:23:07,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2020-12-01 18:23:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2246 states and 2626 transitions. [2020-12-01 18:23:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2626 transitions. [2020-12-01 18:23:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-01 18:23:08,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-01 18:23:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2258 states and 2642 transitions. [2020-12-01 18:23:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2642 transitions. [2020-12-01 18:23:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-12-01 18:23:11,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-01 18:23:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2272 states and 2655 transitions. [2020-12-01 18:23:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2655 transitions. [2020-12-01 18:23:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-01 18:23:14,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 183 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 18:23:20,995 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2020-12-01 18:23:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2339 states and 2740 transitions. [2020-12-01 18:23:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2740 transitions. [2020-12-01 18:23:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-12-01 18:23:30,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-01 18:23:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2470 states and 2882 transitions. [2020-12-01 18:23:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2882 transitions. [2020-12-01 18:23:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-12-01 18:23:37,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 263 proven. 87 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 18:23:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2496 states and 2912 transitions. [2020-12-01 18:23:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2912 transitions. [2020-12-01 18:23:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-01 18:23:42,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-01 18:23:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2510 states and 2926 transitions. [2020-12-01 18:23:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 2926 transitions. [2020-12-01 18:23:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 18:23:44,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-12-01 18:23:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2529 states and 2948 transitions. [2020-12-01 18:23:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 2948 transitions. [2020-12-01 18:23:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 18:23:48,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 18:23:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2545 states and 2966 transitions. [2020-12-01 18:23:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 2966 transitions. [2020-12-01 18:23:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 18:23:50,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 18:23:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2555 states and 2975 transitions. [2020-12-01 18:23:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2975 transitions. [2020-12-01 18:23:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-01 18:23:51,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-12-01 18:23:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 2602 states and 3028 transitions. [2020-12-01 18:23:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3028 transitions. [2020-12-01 18:23:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-01 18:23:56,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:23:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-12-01 18:23:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:23:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 2616 states and 3042 transitions. [2020-12-01 18:23:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3042 transitions. [2020-12-01 18:23:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-01 18:23:58,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:23:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:23:58,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:23:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:23:59,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:23:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:23:59,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:23:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:23:59,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:24:08,918 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 126 iterations. [2020-12-01 18:24:09,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:24:09 ImpRootNode [2020-12-01 18:24:09,217 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 18:24:09,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 18:24:09,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 18:24:09,218 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 18:24:09,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:20:29" (3/4) ... [2020-12-01 18:24:09,222 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 18:24:09,575 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_390b2471-d48a-4b48-b53a-a6ffebfc0fd9/bin/ukojak/witness.graphml [2020-12-01 18:24:09,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 18:24:09,577 INFO L168 Benchmark]: Toolchain (without parser) took 223966.99 ms. Allocated memory was 79.7 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 49.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 518.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,578 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 79.7 MB. Free memory was 37.4 MB in the beginning and 37.3 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 18:24:09,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.64 ms. Allocated memory was 79.7 MB in the beginning and 104.9 MB in the end (delta: 25.2 MB). Free memory was 48.9 MB in the beginning and 66.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.85 ms. Allocated memory is still 104.9 MB. Free memory was 66.5 MB in the beginning and 61.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,579 INFO L168 Benchmark]: Boogie Preprocessor took 122.55 ms. Allocated memory is still 104.9 MB. Free memory was 60.8 MB in the beginning and 56.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,580 INFO L168 Benchmark]: RCFGBuilder took 2856.47 ms. Allocated memory was 104.9 MB in the beginning and 140.5 MB in the end (delta: 35.7 MB). Free memory was 56.0 MB in the beginning and 103.8 MB in the end (delta: -47.9 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,581 INFO L168 Benchmark]: CodeCheck took 219628.34 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 103.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 473.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,581 INFO L168 Benchmark]: Witness Printer took 357.58 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2020-12-01 18:24:09,584 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 219.2s, OverallIterations: 126, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17277248 SDtfs, -502515394 SDslu, 95640960 SDs, 0 SdLazy, 1593923470 SolverSat, 1721865696 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 782.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136459 GetRequests, 131431 SyntacticMatches, 3894 SemanticMatches, 1134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846288 ImplicationChecksByTransitivity, 171.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.9s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 20277 NumberOfCodeBlocks, 20277 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 19909 ConstructedInterpolants, 0 QuantifiedInterpolants, 11631609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 125 InterpolantComputations, 110 PerfectInterpolantSequences, 17181/18183 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label32.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 79.7 MB. Free memory was 37.4 MB in the beginning and 37.3 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 843.64 ms. Allocated memory was 79.7 MB in the beginning and 104.9 MB in the end (delta: 25.2 MB). Free memory was 48.9 MB in the beginning and 66.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 149.85 ms. Allocated memory is still 104.9 MB. Free memory was 66.5 MB in the beginning and 61.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 122.55 ms. Allocated memory is still 104.9 MB. Free memory was 60.8 MB in the beginning and 56.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2856.47 ms. Allocated memory was 104.9 MB in the beginning and 140.5 MB in the end (delta: 35.7 MB). Free memory was 56.0 MB in the beginning and 103.8 MB in the end (delta: -47.9 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. * CodeCheck took 219628.34 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 103.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 473.5 MB. Max. memory is 16.1 GB. * Witness Printer took 357.58 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...