./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2ed652d9060283eed99b129e3cfec21e515617 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:10:38,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:10:38,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:10:38,913 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:10:38,913 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:10:38,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:10:38,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:10:38,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:10:38,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:10:38,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:10:38,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:10:38,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:10:38,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:10:38,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:10:38,920 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:10:38,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:10:38,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:10:38,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:10:38,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:10:38,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:10:38,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:10:38,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:10:38,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:10:38,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:10:38,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:10:38,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:10:38,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:10:38,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:10:38,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:10:38,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:10:38,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:10:38,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:10:38,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:10:38,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:10:38,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:10:38,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:10:38,935 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:10:38,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:10:38,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:10:38,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:10:38,945 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:10:38,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:10:38,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:10:38,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:10:38,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:10:38,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:10:38,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:10:38,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:10:38,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:10:38,947 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:10:38,947 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:10:38,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:10:38,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:10:38,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:10:38,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:10:38,949 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_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb2ed652d9060283eed99b129e3cfec21e515617 [2018-11-10 07:10:38,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:10:38,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:10:38,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:10:38,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:10:38,986 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:10:38,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-11-10 07:10:39,024 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/data/94f5cc024/e0331e2b5fef4519a900c70375870be7/FLAGe75835ce2 [2018-11-10 07:10:39,384 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:10:39,384 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-11-10 07:10:39,394 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/data/94f5cc024/e0331e2b5fef4519a900c70375870be7/FLAGe75835ce2 [2018-11-10 07:10:39,405 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/data/94f5cc024/e0331e2b5fef4519a900c70375870be7 [2018-11-10 07:10:39,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:10:39,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:10:39,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:10:39,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:10:39,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:10:39,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39, skipping insertion in model container [2018-11-10 07:10:39,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:10:39,455 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:10:39,681 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:10:39,684 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:10:39,746 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:10:39,758 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:10:39,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39 WrapperNode [2018-11-10 07:10:39,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:10:39,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:10:39,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:10:39,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:10:39,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:10:39,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:10:39,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:10:39,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:10:39,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... [2018-11-10 07:10:39,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:10:39,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:10:39,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:10:39,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:10:39,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/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-10 07:10:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 07:10:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:10:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:10:41,342 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:10:41,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:10:41 BoogieIcfgContainer [2018-11-10 07:10:41,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:10:41,343 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:10:41,343 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:10:41,350 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:10:41,350 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:10:41" (1/1) ... [2018-11-10 07:10:41,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:10:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 07:10:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 07:10:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 07:10:41,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:41,636 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-10 07:10:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-11-10 07:10:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-11-10 07:10:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 07:10:42,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 245 states and 339 transitions. [2018-11-10 07:10:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2018-11-10 07:10:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 07:10:42,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:42,647 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-10 07:10:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 250 states and 345 transitions. [2018-11-10 07:10:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2018-11-10 07:10:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 07:10:42,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:42,789 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-10 07:10:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 260 states and 360 transitions. [2018-11-10 07:10:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 360 transitions. [2018-11-10 07:10:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 07:10:42,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 263 states and 363 transitions. [2018-11-10 07:10:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2018-11-10 07:10:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 07:10:42,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 268 states and 370 transitions. [2018-11-10 07:10:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2018-11-10 07:10:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 07:10:43,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,106 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-10 07:10:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 273 states and 376 transitions. [2018-11-10 07:10:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2018-11-10 07:10:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 07:10:43,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 291 states and 402 transitions. [2018-11-10 07:10:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2018-11-10 07:10:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 07:10:43,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,508 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-10 07:10:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 292 states and 404 transitions. [2018-11-10 07:10:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2018-11-10 07:10:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 07:10:43,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,600 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-10 07:10:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 296 states and 408 transitions. [2018-11-10 07:10:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 408 transitions. [2018-11-10 07:10:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 07:10:43,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 300 states and 413 transitions. [2018-11-10 07:10:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 413 transitions. [2018-11-10 07:10:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 07:10:43,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 324 states and 445 transitions. [2018-11-10 07:10:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2018-11-10 07:10:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 07:10:44,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:10:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 326 states and 447 transitions. [2018-11-10 07:10:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 447 transitions. [2018-11-10 07:10:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 07:10:44,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:10:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 406 states and 530 transitions. [2018-11-10 07:10:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2018-11-10 07:10:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 07:10:44,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:45,078 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-10 07:10:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 429 states and 561 transitions. [2018-11-10 07:10:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2018-11-10 07:10:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 07:10:45,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:45,897 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-10 07:10:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 433 states and 565 transitions. [2018-11-10 07:10:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 565 transitions. [2018-11-10 07:10:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 07:10:46,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:46,147 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-10 07:10:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 437 states and 569 transitions. [2018-11-10 07:10:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 569 transitions. [2018-11-10 07:10:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:10:46,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:46,569 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-10 07:10:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 471 states and 616 transitions. [2018-11-10 07:10:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2018-11-10 07:10:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:10:47,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:47,773 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-10 07:10:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-11-10 07:10:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-11-10 07:10:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 07:10:47,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:10:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 477 states and 622 transitions. [2018-11-10 07:10:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 622 transitions. [2018-11-10 07:10:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:10:48,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:10:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 491 states and 642 transitions. [2018-11-10 07:10:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2018-11-10 07:10:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 07:10:48,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 498 states and 649 transitions. [2018-11-10 07:10:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 649 transitions. [2018-11-10 07:10:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 07:10:48,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:48,508 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-10 07:10:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 502 states and 653 transitions. [2018-11-10 07:10:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2018-11-10 07:10:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 07:10:48,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:10:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 509 states and 661 transitions. [2018-11-10 07:10:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2018-11-10 07:10:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 07:10:48,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 513 states and 668 transitions. [2018-11-10 07:10:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2018-11-10 07:10:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:10:49,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:49,287 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-10 07:10:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 537 states and 700 transitions. [2018-11-10 07:10:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-11-10 07:10:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:10:50,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:50,342 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-10 07:10:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 543 states and 706 transitions. [2018-11-10 07:10:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 706 transitions. [2018-11-10 07:10:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:10:50,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:50,711 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-10 07:10:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2018-11-10 07:10:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2018-11-10 07:10:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:10:50,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2018-11-10 07:10:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2018-11-10 07:10:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:10:50,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 549 states and 711 transitions. [2018-11-10 07:10:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-11-10 07:10:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:10:50,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:10:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 570 states and 734 transitions. [2018-11-10 07:10:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 734 transitions. [2018-11-10 07:10:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 07:10:51,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:51,619 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-10 07:10:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 589 states and 760 transitions. [2018-11-10 07:10:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 760 transitions. [2018-11-10 07:10:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 07:10:52,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:52,750 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-10 07:10:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 593 states and 764 transitions. [2018-11-10 07:10:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 764 transitions. [2018-11-10 07:10:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 07:10:52,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:10:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 609 states and 782 transitions. [2018-11-10 07:10:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 782 transitions. [2018-11-10 07:10:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 07:10:53,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 618 states and 792 transitions. [2018-11-10 07:10:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 792 transitions. [2018-11-10 07:10:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 07:10:53,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:10:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 620 states and 794 transitions. [2018-11-10 07:10:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 794 transitions. [2018-11-10 07:10:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 07:10:53,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:10:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 622 states and 795 transitions. [2018-11-10 07:10:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 795 transitions. [2018-11-10 07:10:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 07:10:53,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:10:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 629 states and 805 transitions. [2018-11-10 07:10:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 805 transitions. [2018-11-10 07:10:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 07:10:53,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:10:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 633 states and 810 transitions. [2018-11-10 07:10:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 810 transitions. [2018-11-10 07:10:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 07:10:53,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 637 states and 816 transitions. [2018-11-10 07:10:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 816 transitions. [2018-11-10 07:10:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 07:10:54,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:54,104 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-10 07:10:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 639 states and 818 transitions. [2018-11-10 07:10:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 818 transitions. [2018-11-10 07:10:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 07:10:54,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 640 states and 819 transitions. [2018-11-10 07:10:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 819 transitions. [2018-11-10 07:10:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:10:54,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 07:10:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 692 states and 878 transitions. [2018-11-10 07:10:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 878 transitions. [2018-11-10 07:10:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:10:55,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 693 states and 879 transitions. [2018-11-10 07:10:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 879 transitions. [2018-11-10 07:10:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 07:10:55,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:10:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 699 states and 886 transitions. [2018-11-10 07:10:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 886 transitions. [2018-11-10 07:10:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 07:10:55,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 700 states and 888 transitions. [2018-11-10 07:10:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 888 transitions. [2018-11-10 07:10:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 07:10:55,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 706 states and 893 transitions. [2018-11-10 07:10:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 893 transitions. [2018-11-10 07:10:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 07:10:55,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:55,795 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-10 07:10:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 712 states and 900 transitions. [2018-11-10 07:10:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 900 transitions. [2018-11-10 07:10:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:10:56,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:56,246 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-10 07:10:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 730 states and 921 transitions. [2018-11-10 07:10:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 921 transitions. [2018-11-10 07:10:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:10:56,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:56,786 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-10 07:10:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 734 states and 924 transitions. [2018-11-10 07:10:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 924 transitions. [2018-11-10 07:10:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:10:56,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:10:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 763 states and 956 transitions. [2018-11-10 07:10:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 956 transitions. [2018-11-10 07:10:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 07:10:57,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 782 states and 978 transitions. [2018-11-10 07:10:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 978 transitions. [2018-11-10 07:10:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 07:10:57,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 783 states and 979 transitions. [2018-11-10 07:10:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 979 transitions. [2018-11-10 07:10:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 07:10:57,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:10:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 789 states and 984 transitions. [2018-11-10 07:10:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 984 transitions. [2018-11-10 07:10:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 07:10:58,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:58,236 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-10 07:10:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 811 states and 1014 transitions. [2018-11-10 07:10:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1014 transitions. [2018-11-10 07:10:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 07:10:59,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:59,438 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-10 07:10:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 815 states and 1018 transitions. [2018-11-10 07:10:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1018 transitions. [2018-11-10 07:10:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 07:10:59,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:10:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:10:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 818 states and 1021 transitions. [2018-11-10 07:10:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1021 transitions. [2018-11-10 07:10:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 07:10:59,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:10:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:10:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:11:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 843 states and 1047 transitions. [2018-11-10 07:11:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1047 transitions. [2018-11-10 07:11:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 07:11:00,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:11:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 861 states and 1064 transitions. [2018-11-10 07:11:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1064 transitions. [2018-11-10 07:11:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 07:11:01,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:11:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 878 states and 1088 transitions. [2018-11-10 07:11:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1088 transitions. [2018-11-10 07:11:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 07:11:01,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:11:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 882 states and 1092 transitions. [2018-11-10 07:11:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1092 transitions. [2018-11-10 07:11:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 07:11:02,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:11:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 886 states and 1096 transitions. [2018-11-10 07:11:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1096 transitions. [2018-11-10 07:11:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 07:11:02,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:11:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 904 states and 1118 transitions. [2018-11-10 07:11:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1118 transitions. [2018-11-10 07:11:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 07:11:03,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:11:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:11:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:11:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 910 states and 1123 transitions. [2018-11-10 07:11:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1123 transitions. [2018-11-10 07:11:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 07:11:03,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:11:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:11:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:11:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:11:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:11:03,782 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 65 iterations. [2018-11-10 07:11:03,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:11:03 ImpRootNode [2018-11-10 07:11:03,899 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:11:03,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:11:03,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:11:03,899 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:11:03,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:10:41" (3/4) ... [2018-11-10 07:11:03,903 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:11:04,015 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7d11085c-9456-447b-8c3a-b908f5a105ec/bin-2019/ukojak/witness.graphml [2018-11-10 07:11:04,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:11:04,015 INFO L168 Benchmark]: Toolchain (without parser) took 24607.84 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 785.4 MB). Free memory was 950.0 MB in the beginning and 973.5 MB in the end (delta: -23.5 MB). Peak memory consumption was 761.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,016 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:11:04,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.89 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 915.1 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,017 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,017 INFO L168 Benchmark]: RCFGBuilder took 1430.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,017 INFO L168 Benchmark]: CodeCheck took 22555.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 648.5 MB). Free memory was 868.1 MB in the beginning and 993.1 MB in the end (delta: -124.9 MB). Peak memory consumption was 523.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,018 INFO L168 Benchmark]: Witness Printer took 115.85 ms. Allocated memory is still 1.8 GB. Free memory was 993.1 MB in the beginning and 973.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:11:04,019 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, 22.4s OverallTime, 65 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16780400 SDtfs, 1111984918 SDslu, 142632976 SDs, 0 SdLazy, -1375851432 SolverSat, -789645890 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53568 GetRequests, 52824 SyntacticMatches, 326 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111329 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 8494 NumberOfCodeBlocks, 8494 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 8273 ConstructedInterpolants, 0 QuantifiedInterpolants, 2069928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 56 PerfectInterpolantSequences, 4426/4472 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [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 TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] 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=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] RET return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] 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=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.89 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 915.1 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1430.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 11.5 GB. * CodeCheck took 22555.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 648.5 MB). Free memory was 868.1 MB in the beginning and 993.1 MB in the end (delta: -124.9 MB). Peak memory consumption was 523.6 MB. Max. memory is 11.5 GB. * Witness Printer took 115.85 ms. Allocated memory is still 1.8 GB. Free memory was 993.1 MB in the beginning and 973.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...