./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/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 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 15:00:59,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:00:59,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:00:59,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:00:59,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:00:59,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:00:59,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:00:59,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:00:59,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:00:59,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:00:59,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:00:59,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:00:59,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:00:59,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:00:59,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:00:59,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:00:59,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:00:59,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:00:59,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:00:59,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:00:59,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:00:59,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:00:59,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:00:59,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:00:59,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:00:59,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:00:59,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:00:59,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:00:59,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:00:59,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:00:59,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:00:59,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:00:59,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:00:59,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:00:59,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:00:59,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:00:59,627 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 15:00:59,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:00:59,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:00:59,638 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:00:59,638 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 15:00:59,638 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:00:59,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:00:59,638 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:00:59,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:00:59,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:00:59,640 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 15:00:59,640 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 15:00:59,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:00:59,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:00:59,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 15:00:59,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:00:59,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:00:59,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:00:59,641 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 15:00:59,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:00:59,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:00:59,641 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_9a1d8eca-69aa-4a90-9111-852b224be571/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 -> 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 [2018-11-18 15:00:59,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:00:59,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:00:59,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:00:59,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:00:59,673 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:00:59,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-11-18 15:00:59,709 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/data/4d13045ca/55352c7a03b04081b8d300c8c0633a38/FLAG61073e3c3 [2018-11-18 15:01:00,164 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:01:00,165 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-11-18 15:01:00,174 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/data/4d13045ca/55352c7a03b04081b8d300c8c0633a38/FLAG61073e3c3 [2018-11-18 15:01:00,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/data/4d13045ca/55352c7a03b04081b8d300c8c0633a38 [2018-11-18 15:01:00,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:01:00,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:01:00,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:01:00,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:01:00,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:01:00,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00, skipping insertion in model container [2018-11-18 15:01:00,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:01:00,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:01:00,471 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:01:00,474 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:01:00,539 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:01:00,551 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:01:00,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00 WrapperNode [2018-11-18 15:01:00,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:01:00,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:01:00,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:01:00,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:01:00,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:01:00,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:01:00,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:01:00,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:01:00,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... [2018-11-18 15:01:00,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:01:00,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:01:00,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:01:00,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:01:00,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:01:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/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-11-18 15:01:00,751 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:01:00,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:01:00,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:01:02,276 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:01:02,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:01:02 BoogieIcfgContainer [2018-11-18 15:01:02,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:01:02,277 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 15:01:02,277 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 15:01:02,285 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 15:01:02,285 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:01:02" (1/1) ... [2018-11-18 15:01:02,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-18 15:01:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-18 15:01:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:01:02,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 165 states and 253 transitions. [2018-11-18 15:01:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2018-11-18 15:01:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 15:01:02,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 244 states and 344 transitions. [2018-11-18 15:01:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 344 transitions. [2018-11-18 15:01:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 15:01:03,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 249 states and 351 transitions. [2018-11-18 15:01:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 351 transitions. [2018-11-18 15:01:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 15:01:03,710 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 259 states and 363 transitions. [2018-11-18 15:01:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2018-11-18 15:01:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 15:01:03,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 264 states and 368 transitions. [2018-11-18 15:01:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2018-11-18 15:01:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 15:01:03,922 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:01:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 275 states and 383 transitions. [2018-11-18 15:01:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2018-11-18 15:01:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 15:01:04,122 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:01:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 278 states and 386 transitions. [2018-11-18 15:01:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 386 transitions. [2018-11-18 15:01:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 15:01:04,176 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 293 states and 407 transitions. [2018-11-18 15:01:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2018-11-18 15:01:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 15:01:04,467 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 298 states and 413 transitions. [2018-11-18 15:01:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 413 transitions. [2018-11-18 15:01:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 15:01:04,548 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:01:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 300 states and 416 transitions. [2018-11-18 15:01:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 416 transitions. [2018-11-18 15:01:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 15:01:04,614 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 307 states and 423 transitions. [2018-11-18 15:01:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 423 transitions. [2018-11-18 15:01:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 15:01:04,667 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 317 states and 437 transitions. [2018-11-18 15:01:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 437 transitions. [2018-11-18 15:01:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 15:01:04,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 318 states and 437 transitions. [2018-11-18 15:01:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 437 transitions. [2018-11-18 15:01:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 15:01:05,019 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:01:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 325 states and 444 transitions. [2018-11-18 15:01:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 444 transitions. [2018-11-18 15:01:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 15:01:05,076 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 331 states and 450 transitions. [2018-11-18 15:01:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 450 transitions. [2018-11-18 15:01:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 15:01:05,136 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 351 states and 472 transitions. [2018-11-18 15:01:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 472 transitions. [2018-11-18 15:01:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 15:01:05,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 370 states and 494 transitions. [2018-11-18 15:01:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 494 transitions. [2018-11-18 15:01:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 15:01:05,684 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 450 states and 583 transitions. [2018-11-18 15:01:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 583 transitions. [2018-11-18 15:01:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 15:01:06,196 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 484 states and 627 transitions. [2018-11-18 15:01:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 627 transitions. [2018-11-18 15:01:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:01:07,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 497 states and 643 transitions. [2018-11-18 15:01:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 643 transitions. [2018-11-18 15:01:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:01:07,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:01:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 584 states and 734 transitions. [2018-11-18 15:01:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 734 transitions. [2018-11-18 15:01:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:01:08,508 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 599 states and 753 transitions. [2018-11-18 15:01:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 753 transitions. [2018-11-18 15:01:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:01:08,889 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 610 states and 767 transitions. [2018-11-18 15:01:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 767 transitions. [2018-11-18 15:01:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 15:01:09,162 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 621 states and 783 transitions. [2018-11-18 15:01:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 783 transitions. [2018-11-18 15:01:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 15:01:09,580 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 635 states and 805 transitions. [2018-11-18 15:01:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 805 transitions. [2018-11-18 15:01:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 15:01:10,137 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:01:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 644 states and 814 transitions. [2018-11-18 15:01:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 814 transitions. [2018-11-18 15:01:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 15:01:10,269 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 662 states and 836 transitions. [2018-11-18 15:01:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 836 transitions. [2018-11-18 15:01:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:01:10,755 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 686 states and 869 transitions. [2018-11-18 15:01:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 869 transitions. [2018-11-18 15:01:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:01:11,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 693 states and 879 transitions. [2018-11-18 15:01:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 879 transitions. [2018-11-18 15:01:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:01:12,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 701 states and 890 transitions. [2018-11-18 15:01:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 890 transitions. [2018-11-18 15:01:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:01:12,587 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 714 states and 904 transitions. [2018-11-18 15:01:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 904 transitions. [2018-11-18 15:01:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:01:13,060 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 716 states and 910 transitions. [2018-11-18 15:01:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 910 transitions. [2018-11-18 15:01:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:01:13,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 717 states and 910 transitions. [2018-11-18 15:01:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 910 transitions. [2018-11-18 15:01:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:01:13,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 718 states and 910 transitions. [2018-11-18 15:01:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 910 transitions. [2018-11-18 15:01:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:01:13,695 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 723 states and 917 transitions. [2018-11-18 15:01:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 917 transitions. [2018-11-18 15:01:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 15:01:14,016 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 15:01:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 736 states and 930 transitions. [2018-11-18 15:01:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 930 transitions. [2018-11-18 15:01:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 15:01:14,132 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 753 states and 952 transitions. [2018-11-18 15:01:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 952 transitions. [2018-11-18 15:01:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 15:01:14,681 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 754 states and 952 transitions. [2018-11-18 15:01:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 952 transitions. [2018-11-18 15:01:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 15:01:14,892 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 755 states and 952 transitions. [2018-11-18 15:01:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 952 transitions. [2018-11-18 15:01:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 15:01:15,096 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 15:01:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 779 states and 980 transitions. [2018-11-18 15:01:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 980 transitions. [2018-11-18 15:01:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:01:15,650 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:01:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 799 states and 1007 transitions. [2018-11-18 15:01:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1007 transitions. [2018-11-18 15:01:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:01:16,334 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:01:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 809 states and 1018 transitions. [2018-11-18 15:01:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1018 transitions. [2018-11-18 15:01:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:01:16,780 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:01:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 813 states and 1023 transitions. [2018-11-18 15:01:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1023 transitions. [2018-11-18 15:01:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 15:01:16,984 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:01:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 835 states and 1050 transitions. [2018-11-18 15:01:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1050 transitions. [2018-11-18 15:01:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 15:01:17,308 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:01:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 836 states and 1050 transitions. [2018-11-18 15:01:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1050 transitions. [2018-11-18 15:01:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 15:01:17,499 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:01:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 842 states and 1056 transitions. [2018-11-18 15:01:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1056 transitions. [2018-11-18 15:01:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 15:01:17,614 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 875 states and 1092 transitions. [2018-11-18 15:01:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1092 transitions. [2018-11-18 15:01:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 15:01:18,146 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:01:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 909 states and 1139 transitions. [2018-11-18 15:01:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1139 transitions. [2018-11-18 15:01:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:19,031 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 15:01:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 914 states and 1148 transitions. [2018-11-18 15:01:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1148 transitions. [2018-11-18 15:01:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:19,448 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:01:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 918 states and 1152 transitions. [2018-11-18 15:01:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1152 transitions. [2018-11-18 15:01:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:19,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 920 states and 1154 transitions. [2018-11-18 15:01:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1154 transitions. [2018-11-18 15:01:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:19,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 928 states and 1163 transitions. [2018-11-18 15:01:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1163 transitions. [2018-11-18 15:01:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:20,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 929 states and 1163 transitions. [2018-11-18 15:01:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1163 transitions. [2018-11-18 15:01:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:20,127 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 931 states and 1164 transitions. [2018-11-18 15:01:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1164 transitions. [2018-11-18 15:01:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:01:20,247 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 15:01:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 938 states and 1174 transitions. [2018-11-18 15:01:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1174 transitions. [2018-11-18 15:01:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 15:01:20,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:01:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 963 states and 1208 transitions. [2018-11-18 15:01:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1208 transitions. [2018-11-18 15:01:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 15:01:21,392 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:01:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 982 states and 1241 transitions. [2018-11-18 15:01:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1241 transitions. [2018-11-18 15:01:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 15:01:22,413 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:01:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 994 states and 1255 transitions. [2018-11-18 15:01:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1255 transitions. [2018-11-18 15:01:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:01:22,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 15:01:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1001 states and 1262 transitions. [2018-11-18 15:01:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1262 transitions. [2018-11-18 15:01:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:01:23,123 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:01:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1015 states and 1281 transitions. [2018-11-18 15:01:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1281 transitions. [2018-11-18 15:01:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:01:23,800 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:01:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1039 states and 1317 transitions. [2018-11-18 15:01:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1317 transitions. [2018-11-18 15:01:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:01:24,841 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:01:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1047 states and 1325 transitions. [2018-11-18 15:01:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1325 transitions. [2018-11-18 15:01:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 15:01:25,251 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:01:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1060 states and 1339 transitions. [2018-11-18 15:01:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1339 transitions. [2018-11-18 15:01:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:01:25,705 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:01:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1066 states and 1349 transitions. [2018-11-18 15:01:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1349 transitions. [2018-11-18 15:01:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:01:26,332 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1119 states and 1412 transitions. [2018-11-18 15:01:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1412 transitions. [2018-11-18 15:01:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 15:01:28,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 15:01:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1135 states and 1427 transitions. [2018-11-18 15:01:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1427 transitions. [2018-11-18 15:01:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:01:28,709 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1149 states and 1448 transitions. [2018-11-18 15:01:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1448 transitions. [2018-11-18 15:01:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:01:29,380 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1157 states and 1459 transitions. [2018-11-18 15:01:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1459 transitions. [2018-11-18 15:01:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:01:29,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1159 states and 1461 transitions. [2018-11-18 15:01:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1461 transitions. [2018-11-18 15:01:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:01:29,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 15:01:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1167 states and 1468 transitions. [2018-11-18 15:01:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1468 transitions. [2018-11-18 15:01:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 15:01:30,139 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1176 states and 1477 transitions. [2018-11-18 15:01:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1477 transitions. [2018-11-18 15:01:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:01:30,201 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:01:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1178 states and 1478 transitions. [2018-11-18 15:01:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1478 transitions. [2018-11-18 15:01:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:01:30,373 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:01:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1183 states and 1485 transitions. [2018-11-18 15:01:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2018-11-18 15:01:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:01:30,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:01:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1204 states and 1507 transitions. [2018-11-18 15:01:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1507 transitions. [2018-11-18 15:01:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:01:31,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 15:01:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1206 states and 1510 transitions. [2018-11-18 15:01:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1510 transitions. [2018-11-18 15:01:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 15:01:31,818 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 15:01:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1211 states and 1516 transitions. [2018-11-18 15:01:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1516 transitions. [2018-11-18 15:01:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 15:01:32,024 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1280 states and 1596 transitions. [2018-11-18 15:01:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1596 transitions. [2018-11-18 15:01:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:01:35,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1316 states and 1639 transitions. [2018-11-18 15:01:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1639 transitions. [2018-11-18 15:01:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 15:01:38,320 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1331 states and 1658 transitions. [2018-11-18 15:01:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1658 transitions. [2018-11-18 15:01:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 15:01:39,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 15:01:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1343 states and 1674 transitions. [2018-11-18 15:01:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1674 transitions. [2018-11-18 15:01:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 15:01:39,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 15:01:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1346 states and 1681 transitions. [2018-11-18 15:01:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1681 transitions. [2018-11-18 15:01:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:01:40,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:01:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1351 states and 1687 transitions. [2018-11-18 15:01:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1687 transitions. [2018-11-18 15:01:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 15:01:40,109 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:01:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1387 states and 1724 transitions. [2018-11-18 15:01:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1724 transitions. [2018-11-18 15:01:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 15:01:43,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:01:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1456 states and 1793 transitions. [2018-11-18 15:01:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1793 transitions. [2018-11-18 15:01:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 15:01:47,903 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:01:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1484 states and 1820 transitions. [2018-11-18 15:01:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1820 transitions. [2018-11-18 15:01:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 15:01:50,689 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 1 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 15:01:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1503 states and 1840 transitions. [2018-11-18 15:01:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1840 transitions. [2018-11-18 15:01:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:01:50,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1523 states and 1864 transitions. [2018-11-18 15:01:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1864 transitions. [2018-11-18 15:01:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:01:51,632 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1527 states and 1867 transitions. [2018-11-18 15:01:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1867 transitions. [2018-11-18 15:01:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 15:01:51,852 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 15:01:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 15:01:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1529 states and 1868 transitions. [2018-11-18 15:01:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1868 transitions. [2018-11-18 15:01:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 15:01:52,236 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 15:01:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:01:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:01:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:01:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:01:52,442 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 90 iterations. [2018-11-18 15:01:52,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 03:01:52 ImpRootNode [2018-11-18 15:01:52,550 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 15:01:52,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:01:52,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:01:52,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:01:52,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:01:02" (3/4) ... [2018-11-18 15:01:52,555 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 15:01:52,658 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a1d8eca-69aa-4a90-9111-852b224be571/bin-2019/ukojak/witness.graphml [2018-11-18 15:01:52,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:01:52,658 INFO L168 Benchmark]: Toolchain (without parser) took 52469.40 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 953.9 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 195.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,659 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:01:52,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 924.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 924.2 MB in the beginning and 1.1 GB in the end (delta: -223.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,660 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,660 INFO L168 Benchmark]: RCFGBuilder took 1577.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 235.4 MB). Peak memory consumption was 235.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,660 INFO L168 Benchmark]: CodeCheck took 50273.25 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 905.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:01:52,661 INFO L168 Benchmark]: Witness Printer took 107.17 ms. Allocated memory is still 2.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:01:52,662 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, 228 locations, 1 error locations. UNSAFE Result, 50.1s OverallTime, 90 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 83941888 SDtfs, 1414748262 SDslu, 671545344 SDs, 0 SdLazy, -266493858 SolverSat, -504334820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 186.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81896 GetRequests, 80477 SyntacticMatches, 597 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441917 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 12447 NumberOfCodeBlocks, 12447 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 12177 ConstructedInterpolants, 0 QuantifiedInterpolants, 4310595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 79 PerfectInterpolantSequences, 7471/7528 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: 430]: 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)) [L614] CALL, EXPR calculate_output(input) [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 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, 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=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [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)) [L614] CALL, EXPR calculate_output(input) [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=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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, 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=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L369] a11 = 1 [L370] a19 = 0 [L371] a25 = 1 [L372] a17 = 7 [L373] a28 = 9 [L374] RET return -1; VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [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)) [L614] CALL calculate_output(input) [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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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=7, a19=0, a21=1, a25=1, 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))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] __VERIFIER_error() VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 924.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 924.2 MB in the beginning and 1.1 GB in the end (delta: -223.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.63 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1577.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 235.4 MB). Peak memory consumption was 235.4 MB. Max. memory is 11.5 GB. * CodeCheck took 50273.25 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 905.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 107.17 ms. Allocated memory is still 2.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...