./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2ed652d9060283eed99b129e3cfec21e515617 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 02:49:30,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:49:30,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:49:30,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:49:30,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:49:30,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:49:30,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:49:30,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:49:30,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:49:30,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:49:30,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:49:30,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:49:30,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:49:30,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:49:30,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:49:30,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:49:30,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:49:30,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:49:30,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:49:30,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:49:30,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:49:30,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:49:30,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:49:30,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:49:30,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:49:30,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:49:30,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:49:30,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:49:30,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:49:30,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:49:30,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:49:30,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:49:30,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:49:30,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:49:30,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:49:30,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:49:30,146 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 02:49:30,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:49:30,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:49:30,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:49:30,154 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 02:49:30,154 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:49:30,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:49:30,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:49:30,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:49:30,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:49:30,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:49:30,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:49:30,156 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 02:49:30,156 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 02:49:30,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:49:30,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:49:30,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 02:49:30,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:49:30,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2ed652d9060283eed99b129e3cfec21e515617 [2018-12-09 02:49:30,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:49:30,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:49:30,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:49:30,184 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:49:30,184 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:49:30,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-12-09 02:49:30,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/data/7ec7d67dc/210e6ead2a0f4d769a4b4b0460ee7cce/FLAG09db6ea49 [2018-12-09 02:49:30,590 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:49:30,590 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-12-09 02:49:30,597 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/data/7ec7d67dc/210e6ead2a0f4d769a4b4b0460ee7cce/FLAG09db6ea49 [2018-12-09 02:49:30,957 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/data/7ec7d67dc/210e6ead2a0f4d769a4b4b0460ee7cce [2018-12-09 02:49:30,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:49:30,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:49:30,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:30,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:49:30,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:49:30,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:30" (1/1) ... [2018-12-09 02:49:30,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7a2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:30, skipping insertion in model container [2018-12-09 02:49:30,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:30" (1/1) ... [2018-12-09 02:49:30,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:49:31,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:49:31,187 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:31,190 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:49:31,290 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:31,303 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:49:31,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31 WrapperNode [2018-12-09 02:49:31,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:31,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:49:31,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:49:31,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:49:31,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:49:31,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:49:31,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:49:31,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:49:31,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... [2018-12-09 02:49:31,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:49:31,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:49:31,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:49:31,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:49:31,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 02:49:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:49:31,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:49:32,507 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:49:32,507 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 02:49:32,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:32 BoogieIcfgContainer [2018-12-09 02:49:32,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:49:32,508 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 02:49:32,508 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 02:49:32,515 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 02:49:32,515 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:32" (1/1) ... [2018-12-09 02:49:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-09 02:49:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-09 02:49:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 02:49:32,551 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2018-12-09 02:49:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2018-12-09 02:49:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 02:49:33,096 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2018-12-09 02:49:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2018-12-09 02:49:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 02:49:33,474 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 246 states and 341 transitions. [2018-12-09 02:49:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2018-12-09 02:49:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 02:49:33,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 255 states and 355 transitions. [2018-12-09 02:49:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2018-12-09 02:49:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 02:49:33,757 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 258 states and 358 transitions. [2018-12-09 02:49:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2018-12-09 02:49:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:49:33,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 262 states and 364 transitions. [2018-12-09 02:49:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2018-12-09 02:49:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 02:49:33,918 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 02:49:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 266 states and 369 transitions. [2018-12-09 02:49:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2018-12-09 02:49:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 02:49:34,086 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 283 states and 394 transitions. [2018-12-09 02:49:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2018-12-09 02:49:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 02:49:34,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 284 states and 396 transitions. [2018-12-09 02:49:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2018-12-09 02:49:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 02:49:34,428 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 287 states and 399 transitions. [2018-12-09 02:49:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 399 transitions. [2018-12-09 02:49:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 02:49:34,531 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 290 states and 403 transitions. [2018-12-09 02:49:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2018-12-09 02:49:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 02:49:34,630 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 313 states and 434 transitions. [2018-12-09 02:49:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2018-12-09 02:49:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 02:49:35,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 315 states and 436 transitions. [2018-12-09 02:49:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2018-12-09 02:49:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 02:49:35,192 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 394 states and 518 transitions. [2018-12-09 02:49:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2018-12-09 02:49:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 02:49:35,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 416 states and 548 transitions. [2018-12-09 02:49:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2018-12-09 02:49:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 02:49:36,434 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 419 states and 551 transitions. [2018-12-09 02:49:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2018-12-09 02:49:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 02:49:36,599 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 422 states and 554 transitions. [2018-12-09 02:49:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 554 transitions. [2018-12-09 02:49:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 02:49:36,762 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 454 states and 599 transitions. [2018-12-09 02:49:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2018-12-09 02:49:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 02:49:37,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 457 states and 602 transitions. [2018-12-09 02:49:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 602 transitions. [2018-12-09 02:49:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 02:49:38,175 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 02:49:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 459 states and 604 transitions. [2018-12-09 02:49:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2018-12-09 02:49:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 02:49:38,275 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 473 states and 624 transitions. [2018-12-09 02:49:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2018-12-09 02:49:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 02:49:38,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 477 states and 628 transitions. [2018-12-09 02:49:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2018-12-09 02:49:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 02:49:38,624 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 02:49:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 484 states and 635 transitions. [2018-12-09 02:49:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 635 transitions. [2018-12-09 02:49:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 02:49:38,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 02:49:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2018-12-09 02:49:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2018-12-09 02:49:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 02:49:38,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 515 states and 673 transitions. [2018-12-09 02:49:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 673 transitions. [2018-12-09 02:49:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 02:49:39,989 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 521 states and 680 transitions. [2018-12-09 02:49:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 680 transitions. [2018-12-09 02:49:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 02:49:40,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 525 states and 683 transitions. [2018-12-09 02:49:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 683 transitions. [2018-12-09 02:49:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 02:49:40,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 02:49:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2018-12-09 02:49:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2018-12-09 02:49:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 02:49:40,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 550 states and 714 transitions. [2018-12-09 02:49:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 714 transitions. [2018-12-09 02:49:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 02:49:41,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 02:49:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 551 states and 715 transitions. [2018-12-09 02:49:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2018-12-09 02:49:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 02:49:41,048 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2018-12-09 02:49:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2018-12-09 02:49:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 02:49:41,077 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 570 states and 741 transitions. [2018-12-09 02:49:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 741 transitions. [2018-12-09 02:49:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 02:49:42,220 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 573 states and 744 transitions. [2018-12-09 02:49:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2018-12-09 02:49:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 02:49:42,428 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 589 states and 762 transitions. [2018-12-09 02:49:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 762 transitions. [2018-12-09 02:49:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 02:49:42,497 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 02:49:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 591 states and 763 transitions. [2018-12-09 02:49:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2018-12-09 02:49:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 02:49:42,523 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 02:49:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 598 states and 773 transitions. [2018-12-09 02:49:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 773 transitions. [2018-12-09 02:49:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 02:49:42,940 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 02:49:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 602 states and 778 transitions. [2018-12-09 02:49:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 778 transitions. [2018-12-09 02:49:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 02:49:43,112 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 02:49:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 611 states and 788 transitions. [2018-12-09 02:49:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 788 transitions. [2018-12-09 02:49:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 02:49:43,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 613 states and 790 transitions. [2018-12-09 02:49:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 790 transitions. [2018-12-09 02:49:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-09 02:49:43,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 617 states and 797 transitions. [2018-12-09 02:49:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 797 transitions. [2018-12-09 02:49:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-09 02:49:43,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 619 states and 799 transitions. [2018-12-09 02:49:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 799 transitions. [2018-12-09 02:49:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 02:49:43,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 02:49:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 669 states and 855 transitions. [2018-12-09 02:49:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 855 transitions. [2018-12-09 02:49:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 02:49:44,748 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 674 states and 862 transitions. [2018-12-09 02:49:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 862 transitions. [2018-12-09 02:49:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 02:49:45,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 675 states and 863 transitions. [2018-12-09 02:49:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 863 transitions. [2018-12-09 02:49:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 02:49:45,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 02:49:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 681 states and 871 transitions. [2018-12-09 02:49:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 871 transitions. [2018-12-09 02:49:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 02:49:45,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 02:49:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 687 states and 877 transitions. [2018-12-09 02:49:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 877 transitions. [2018-12-09 02:49:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 02:49:45,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 688 states and 878 transitions. [2018-12-09 02:49:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 878 transitions. [2018-12-09 02:49:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 02:49:45,850 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 702 states and 892 transitions. [2018-12-09 02:49:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 892 transitions. [2018-12-09 02:49:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 02:49:46,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 02:49:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 706 states and 895 transitions. [2018-12-09 02:49:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 895 transitions. [2018-12-09 02:49:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 02:49:46,209 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 724 states and 917 transitions. [2018-12-09 02:49:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 917 transitions. [2018-12-09 02:49:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 02:49:46,985 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 725 states and 917 transitions. [2018-12-09 02:49:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 917 transitions. [2018-12-09 02:49:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 02:49:47,067 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 726 states and 918 transitions. [2018-12-09 02:49:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 918 transitions. [2018-12-09 02:49:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 02:49:47,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 730 states and 923 transitions. [2018-12-09 02:49:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 923 transitions. [2018-12-09 02:49:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 02:49:47,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 758 states and 954 transitions. [2018-12-09 02:49:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 954 transitions. [2018-12-09 02:49:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 02:49:47,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 786 states and 988 transitions. [2018-12-09 02:49:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 988 transitions. [2018-12-09 02:49:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 02:49:48,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 02:49:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 789 states and 991 transitions. [2018-12-09 02:49:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 991 transitions. [2018-12-09 02:49:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 02:49:49,139 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 792 states and 994 transitions. [2018-12-09 02:49:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 994 transitions. [2018-12-09 02:49:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 02:49:49,171 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 02:49:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 816 states and 1018 transitions. [2018-12-09 02:49:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1018 transitions. [2018-12-09 02:49:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 02:49:50,135 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 836 states and 1039 transitions. [2018-12-09 02:49:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1039 transitions. [2018-12-09 02:49:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 02:49:50,543 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 852 states and 1062 transitions. [2018-12-09 02:49:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1062 transitions. [2018-12-09 02:49:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 02:49:52,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 855 states and 1065 transitions. [2018-12-09 02:49:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1065 transitions. [2018-12-09 02:49:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 02:49:52,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 858 states and 1068 transitions. [2018-12-09 02:49:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1068 transitions. [2018-12-09 02:49:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 02:49:52,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 878 states and 1092 transitions. [2018-12-09 02:49:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1092 transitions. [2018-12-09 02:49:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 02:49:53,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 02:49:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:49:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 882 states and 1095 transitions. [2018-12-09 02:49:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1095 transitions. [2018-12-09 02:49:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 02:49:53,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:49:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:53,971 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 65 iterations. [2018-12-09 02:49:54,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 02:49:54 ImpRootNode [2018-12-09 02:49:54,045 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 02:49:54,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:49:54,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:49:54,046 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:49:54,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:32" (3/4) ... [2018-12-09 02:49:54,048 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:49:54,133 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5e47de69-85d6-4d6f-9efc-3e13adb35a20/bin-2019/ukojak/witness.graphml [2018-12-09 02:49:54,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:49:54,134 INFO L168 Benchmark]: Toolchain (without parser) took 23174.90 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 754.5 MB). Free memory was 950.6 MB in the beginning and 1.7 GB in the end (delta: -722.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,135 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:54,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,135 INFO L168 Benchmark]: Boogie Preprocessor took 42.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,136 INFO L168 Benchmark]: RCFGBuilder took 1111.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.9 MB in the end (delta: 218.4 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,136 INFO L168 Benchmark]: CodeCheck took 21537.44 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.0 MB). Free memory was 889.9 MB in the beginning and 1.7 GB in the end (delta: -802.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:54,136 INFO L168 Benchmark]: Witness Printer took 87.87 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:54,138 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 227 locations, 1 error locations. UNSAFE Result, 21.4s OverallTime, 65 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33557616 SDtfs, 1036931008 SDslu, 218124080 SDs, 0 SdLazy, -1790738438 SolverSat, -1191874498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52515 GetRequests, 51747 SyntacticMatches, 356 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112569 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 8287 NumberOfCodeBlocks, 8287 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 8069 ConstructedInterpolants, 0 QuantifiedInterpolants, 1974303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 56 PerfectInterpolantSequences, 4155/4206 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1111.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.9 MB in the end (delta: 218.4 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. * CodeCheck took 21537.44 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.0 MB). Free memory was 889.9 MB in the beginning and 1.7 GB in the end (delta: -802.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 87.87 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...