./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/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 2239efb232e6960cd140d60028ed9446da6b2730 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 11:54:26,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:54:26,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:54:26,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:54:26,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:54:26,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:54:26,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:54:26,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:54:26,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:54:26,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:54:26,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:54:26,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:54:26,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:54:26,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:54:26,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:54:26,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:54:26,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:54:26,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:54:26,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:54:26,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:54:26,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:54:26,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:54:26,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:54:26,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:54:26,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:54:26,465 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:54:26,466 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:54:26,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:54:26,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:54:26,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:54:26,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:54:26,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:54:26,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:54:26,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:54:26,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:54:26,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:54:26,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 11:54:26,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:54:26,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:54:26,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:54:26,477 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 11:54:26,477 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:54:26,477 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:54:26,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:54:26,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:54:26,478 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 11:54:26,479 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:54:26,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 11:54:26,479 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 11:54:26,479 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 11:54:26,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:54:26,479 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:54:26,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 11:54:26,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:54:26,480 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:54:26,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 11:54:26,480 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 11:54:26,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:54:26,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 11:54:26,480 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_3cf8ebc7-a853-4b50-90f8-14b16a02184f/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 -> 2239efb232e6960cd140d60028ed9446da6b2730 [2018-12-08 11:54:26,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:54:26,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:54:26,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:54:26,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:54:26,511 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:54:26,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-12-08 11:54:26,548 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/data/0bd34a823/7ae90a0dcc024b32934bf956c3c313b5/FLAGa50751b59 [2018-12-08 11:54:27,032 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:54:27,033 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-12-08 11:54:27,041 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/data/0bd34a823/7ae90a0dcc024b32934bf956c3c313b5/FLAGa50751b59 [2018-12-08 11:54:27,050 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/data/0bd34a823/7ae90a0dcc024b32934bf956c3c313b5 [2018-12-08 11:54:27,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:54:27,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 11:54:27,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:54:27,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:54:27,056 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:54:27,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f792852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27, skipping insertion in model container [2018-12-08 11:54:27,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:54:27,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:54:27,254 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:54:27,257 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:54:27,348 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:54:27,357 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:54:27,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27 WrapperNode [2018-12-08 11:54:27,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:54:27,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 11:54:27,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 11:54:27,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 11:54:27,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 11:54:27,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:54:27,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:54:27,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:54:27,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... [2018-12-08 11:54:27,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:54:27,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:54:27,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:54:27,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:54:27,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:54:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 11:54:27,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:54:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:54:28,454 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:54:28,454 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 11:54:28,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:54:28 BoogieIcfgContainer [2018-12-08 11:54:28,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:54:28,455 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 11:54:28,455 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 11:54:28,464 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 11:54:28,465 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:54:28" (1/1) ... [2018-12-08 11:54:28,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:54:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-08 11:54:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-08 11:54:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 11:54:28,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2018-12-08 11:54:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2018-12-08 11:54:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 11:54:28,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2018-12-08 11:54:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2018-12-08 11:54:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 11:54:29,115 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2018-12-08 11:54:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2018-12-08 11:54:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 11:54:29,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2018-12-08 11:54:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2018-12-08 11:54:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 11:54:29,306 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2018-12-08 11:54:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2018-12-08 11:54:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 11:54:29,494 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 11:54:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2018-12-08 11:54:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2018-12-08 11:54:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 11:54:29,860 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2018-12-08 11:54:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2018-12-08 11:54:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 11:54:29,936 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2018-12-08 11:54:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2018-12-08 11:54:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 11:54:30,048 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2018-12-08 11:54:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2018-12-08 11:54:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 11:54:30,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2018-12-08 11:54:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2018-12-08 11:54:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 11:54:30,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2018-12-08 11:54:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2018-12-08 11:54:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 11:54:30,903 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2018-12-08 11:54:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2018-12-08 11:54:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 11:54:30,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2018-12-08 11:54:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2018-12-08 11:54:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 11:54:30,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2018-12-08 11:54:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2018-12-08 11:54:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 11:54:31,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2018-12-08 11:54:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2018-12-08 11:54:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 11:54:31,549 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2018-12-08 11:54:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2018-12-08 11:54:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 11:54:31,657 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2018-12-08 11:54:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2018-12-08 11:54:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 11:54:31,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2018-12-08 11:54:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2018-12-08 11:54:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 11:54:32,074 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2018-12-08 11:54:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2018-12-08 11:54:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 11:54:32,636 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2018-12-08 11:54:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2018-12-08 11:54:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 11:54:32,744 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2018-12-08 11:54:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2018-12-08 11:54:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 11:54:33,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2018-12-08 11:54:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2018-12-08 11:54:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:54:33,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2018-12-08 11:54:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2018-12-08 11:54:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:54:33,921 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2018-12-08 11:54:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2018-12-08 11:54:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 11:54:33,969 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2018-12-08 11:54:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2018-12-08 11:54:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 11:54:34,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2018-12-08 11:54:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2018-12-08 11:54:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 11:54:34,446 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2018-12-08 11:54:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2018-12-08 11:54:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:54:35,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2018-12-08 11:54:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2018-12-08 11:54:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:35,982 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 362 states and 547 transitions. [2018-12-08 11:54:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 547 transitions. [2018-12-08 11:54:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:38,009 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 372 states and 560 transitions. [2018-12-08 11:54:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 560 transitions. [2018-12-08 11:54:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:38,741 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 382 states and 571 transitions. [2018-12-08 11:54:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 571 transitions. [2018-12-08 11:54:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:39,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2018-12-08 11:54:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2018-12-08 11:54:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:39,289 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 389 states and 578 transitions. [2018-12-08 11:54:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 578 transitions. [2018-12-08 11:54:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:39,574 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 390 states and 579 transitions. [2018-12-08 11:54:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 579 transitions. [2018-12-08 11:54:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:39,849 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2018-12-08 11:54:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2018-12-08 11:54:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:54:40,146 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2018-12-08 11:54:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2018-12-08 11:54:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 11:54:40,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 407 states and 607 transitions. [2018-12-08 11:54:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2018-12-08 11:54:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 11:54:41,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 418 states and 618 transitions. [2018-12-08 11:54:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 618 transitions. [2018-12-08 11:54:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 11:54:42,048 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 429 states and 631 transitions. [2018-12-08 11:54:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 631 transitions. [2018-12-08 11:54:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 11:54:42,849 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 436 states and 641 transitions. [2018-12-08 11:54:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 641 transitions. [2018-12-08 11:54:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 11:54:43,372 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 437 states and 642 transitions. [2018-12-08 11:54:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 642 transitions. [2018-12-08 11:54:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 11:54:43,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 438 states and 642 transitions. [2018-12-08 11:54:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 642 transitions. [2018-12-08 11:54:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 11:54:43,670 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 466 states and 674 transitions. [2018-12-08 11:54:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 674 transitions. [2018-12-08 11:54:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 11:54:45,193 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 489 states and 709 transitions. [2018-12-08 11:54:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 709 transitions. [2018-12-08 11:54:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 11:54:46,753 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 501 states and 720 transitions. [2018-12-08 11:54:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 720 transitions. [2018-12-08 11:54:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 11:54:47,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 502 states and 720 transitions. [2018-12-08 11:54:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 720 transitions. [2018-12-08 11:54:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:54:47,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 511 states and 728 transitions. [2018-12-08 11:54:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 728 transitions. [2018-12-08 11:54:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:54:48,094 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 581 states and 806 transitions. [2018-12-08 11:54:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 806 transitions. [2018-12-08 11:54:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:54:48,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 590 states and 819 transitions. [2018-12-08 11:54:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 819 transitions. [2018-12-08 11:54:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:54:49,835 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 601 states and 829 transitions. [2018-12-08 11:54:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 829 transitions. [2018-12-08 11:54:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:54:50,174 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 602 states and 829 transitions. [2018-12-08 11:54:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 829 transitions. [2018-12-08 11:54:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 11:54:50,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 611 states and 841 transitions. [2018-12-08 11:54:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 841 transitions. [2018-12-08 11:54:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 11:54:50,347 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 624 states and 856 transitions. [2018-12-08 11:54:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 856 transitions. [2018-12-08 11:54:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 11:54:50,626 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 626 states and 857 transitions. [2018-12-08 11:54:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 857 transitions. [2018-12-08 11:54:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 11:54:50,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 630 states and 860 transitions. [2018-12-08 11:54:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 860 transitions. [2018-12-08 11:54:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 11:54:50,885 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 632 states and 861 transitions. [2018-12-08 11:54:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 861 transitions. [2018-12-08 11:54:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 11:54:51,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 646 states and 877 transitions. [2018-12-08 11:54:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 877 transitions. [2018-12-08 11:54:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-08 11:54:51,352 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:54:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 648 states and 880 transitions. [2018-12-08 11:54:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 880 transitions. [2018-12-08 11:54:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 11:54:51,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 693 states and 929 transitions. [2018-12-08 11:54:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 929 transitions. [2018-12-08 11:54:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 11:54:54,704 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 717 states and 962 transitions. [2018-12-08 11:54:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 962 transitions. [2018-12-08 11:54:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 11:54:57,553 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:54:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 730 states and 981 transitions. [2018-12-08 11:54:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 981 transitions. [2018-12-08 11:54:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 11:54:58,297 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:54:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:54:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 743 states and 1015 transitions. [2018-12-08 11:54:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1015 transitions. [2018-12-08 11:54:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 11:54:59,462 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:54:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:54:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:55:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 748 states and 1025 transitions. [2018-12-08 11:55:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1025 transitions. [2018-12-08 11:55:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 11:55:00,110 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:55:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 753 states and 1032 transitions. [2018-12-08 11:55:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1032 transitions. [2018-12-08 11:55:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 11:55:00,628 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 761 states and 1042 transitions. [2018-12-08 11:55:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1042 transitions. [2018-12-08 11:55:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 11:55:01,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 766 states and 1046 transitions. [2018-12-08 11:55:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1046 transitions. [2018-12-08 11:55:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 11:55:01,570 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:55:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 806 states and 1098 transitions. [2018-12-08 11:55:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1098 transitions. [2018-12-08 11:55:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 11:55:04,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:55:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 816 states and 1106 transitions. [2018-12-08 11:55:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1106 transitions. [2018-12-08 11:55:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 11:55:04,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 11:55:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 826 states and 1116 transitions. [2018-12-08 11:55:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1116 transitions. [2018-12-08 11:55:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 11:55:05,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 847 states and 1143 transitions. [2018-12-08 11:55:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1143 transitions. [2018-12-08 11:55:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 11:55:06,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 11:55:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 927 states and 1229 transitions. [2018-12-08 11:55:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1229 transitions. [2018-12-08 11:55:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 11:55:06,826 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 11:55:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 936 states and 1251 transitions. [2018-12-08 11:55:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1251 transitions. [2018-12-08 11:55:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 11:55:08,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 11:55:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 963 states and 1285 transitions. [2018-12-08 11:55:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1285 transitions. [2018-12-08 11:55:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 11:55:09,743 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 11:55:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 994 states and 1321 transitions. [2018-12-08 11:55:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1321 transitions. [2018-12-08 11:55:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 11:55:11,202 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:17,483 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-08 11:55:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1061 states and 1393 transitions. [2018-12-08 11:55:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1393 transitions. [2018-12-08 11:55:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 11:55:19,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-08 11:55:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1070 states and 1404 transitions. [2018-12-08 11:55:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1404 transitions. [2018-12-08 11:55:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 11:55:19,937 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-08 11:55:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1071 states and 1404 transitions. [2018-12-08 11:55:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1404 transitions. [2018-12-08 11:55:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 11:55:20,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 11:55:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1092 states and 1435 transitions. [2018-12-08 11:55:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1435 transitions. [2018-12-08 11:55:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 11:55:20,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 11:55:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1100 states and 1445 transitions. [2018-12-08 11:55:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1445 transitions. [2018-12-08 11:55:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 11:55:21,421 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1127 states and 1481 transitions. [2018-12-08 11:55:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1481 transitions. [2018-12-08 11:55:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 11:55:22,691 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1140 states and 1505 transitions. [2018-12-08 11:55:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1505 transitions. [2018-12-08 11:55:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 11:55:23,903 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1156 states and 1523 transitions. [2018-12-08 11:55:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1523 transitions. [2018-12-08 11:55:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 11:55:24,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1167 states and 1533 transitions. [2018-12-08 11:55:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1533 transitions. [2018-12-08 11:55:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 11:55:25,205 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1168 states and 1534 transitions. [2018-12-08 11:55:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1534 transitions. [2018-12-08 11:55:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 11:55:25,240 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1181 states and 1547 transitions. [2018-12-08 11:55:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1547 transitions. [2018-12-08 11:55:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 11:55:25,326 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1193 states and 1561 transitions. [2018-12-08 11:55:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1561 transitions. [2018-12-08 11:55:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 11:55:25,846 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1203 states and 1571 transitions. [2018-12-08 11:55:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1571 transitions. [2018-12-08 11:55:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 11:55:26,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 11:55:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1219 states and 1597 transitions. [2018-12-08 11:55:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1597 transitions. [2018-12-08 11:55:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 11:55:27,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 11:55:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1231 states and 1612 transitions. [2018-12-08 11:55:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1612 transitions. [2018-12-08 11:55:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 11:55:28,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 11:55:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1235 states and 1620 transitions. [2018-12-08 11:55:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1620 transitions. [2018-12-08 11:55:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 11:55:28,636 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1284 states and 1675 transitions. [2018-12-08 11:55:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1675 transitions. [2018-12-08 11:55:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 11:55:33,019 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1309 states and 1707 transitions. [2018-12-08 11:55:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1707 transitions. [2018-12-08 11:55:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 11:55:34,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1313 states and 1712 transitions. [2018-12-08 11:55:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1712 transitions. [2018-12-08 11:55:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 11:55:34,500 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 11:55:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1318 states and 1716 transitions. [2018-12-08 11:55:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1716 transitions. [2018-12-08 11:55:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 11:55:35,089 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 11:55:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1340 states and 1748 transitions. [2018-12-08 11:55:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1748 transitions. [2018-12-08 11:55:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 11:55:36,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 11:55:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1348 states and 1758 transitions. [2018-12-08 11:55:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1758 transitions. [2018-12-08 11:55:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 11:55:37,634 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1406 states and 1818 transitions. [2018-12-08 11:55:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1818 transitions. [2018-12-08 11:55:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 11:55:40,452 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 11:55:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1416 states and 1827 transitions. [2018-12-08 11:55:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1827 transitions. [2018-12-08 11:55:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 11:55:40,960 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 11:55:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1448 states and 1860 transitions. [2018-12-08 11:55:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1860 transitions. [2018-12-08 11:55:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 11:55:41,664 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-08 11:55:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1452 states and 1871 transitions. [2018-12-08 11:55:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1871 transitions. [2018-12-08 11:55:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 11:55:42,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 11:55:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1476 states and 1897 transitions. [2018-12-08 11:55:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1897 transitions. [2018-12-08 11:55:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:43,317 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 11:55:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1492 states and 1918 transitions. [2018-12-08 11:55:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1918 transitions. [2018-12-08 11:55:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:45,430 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 11:55:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1502 states and 1932 transitions. [2018-12-08 11:55:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1932 transitions. [2018-12-08 11:55:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:46,835 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 11:55:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1507 states and 1941 transitions. [2018-12-08 11:55:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1941 transitions. [2018-12-08 11:55:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:47,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 11:55:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1532 states and 1970 transitions. [2018-12-08 11:55:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1970 transitions. [2018-12-08 11:55:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:48,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 11:55:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1536 states and 1975 transitions. [2018-12-08 11:55:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1975 transitions. [2018-12-08 11:55:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 11:55:49,176 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 11:55:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1537 states and 1975 transitions. [2018-12-08 11:55:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1975 transitions. [2018-12-08 11:55:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 11:55:49,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:55:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1601 states and 2044 transitions. [2018-12-08 11:55:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2044 transitions. [2018-12-08 11:55:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 11:55:55,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 11:55:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1634 states and 2077 transitions. [2018-12-08 11:55:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2077 transitions. [2018-12-08 11:55:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 11:55:56,887 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 11:55:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1641 states and 2088 transitions. [2018-12-08 11:55:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2088 transitions. [2018-12-08 11:55:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 11:55:58,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 11:55:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:55:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1645 states and 2092 transitions. [2018-12-08 11:55:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2092 transitions. [2018-12-08 11:55:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 11:55:59,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:55:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:55:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:56:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:56:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 1665 states and 2119 transitions. [2018-12-08 11:56:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2119 transitions. [2018-12-08 11:56:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 11:56:02,258 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:56:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:56:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:56:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:56:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 1672 states and 2128 transitions. [2018-12-08 11:56:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2128 transitions. [2018-12-08 11:56:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 11:56:04,985 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:56:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:56:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:56:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:56:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 1677 states and 2135 transitions. [2018-12-08 11:56:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2135 transitions. [2018-12-08 11:56:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 11:56:05,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:56:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:56:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:56:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:56:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 1681 states and 2143 transitions. [2018-12-08 11:56:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2143 transitions. [2018-12-08 11:56:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 11:56:06,813 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:56:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:56:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 11:56:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 11:56:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 1689 states and 2154 transitions. [2018-12-08 11:56:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2154 transitions. [2018-12-08 11:56:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 11:56:07,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 11:56:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:56:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:56:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:56:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:56:07,772 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 117 iterations. [2018-12-08 11:56:07,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 11:56:07 ImpRootNode [2018-12-08 11:56:07,858 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 11:56:07,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:56:07,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:56:07,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:56:07,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:54:28" (3/4) ... [2018-12-08 11:56:07,860 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 11:56:07,943 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3cf8ebc7-a853-4b50-90f8-14b16a02184f/bin-2019/ukojak/witness.graphml [2018-12-08 11:56:07,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:56:07,943 INFO L168 Benchmark]: Toolchain (without parser) took 100890.99 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 946.3 MB in the beginning and 1.3 GB in the end (delta: -370.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,944 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:56:07,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,944 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,944 INFO L168 Benchmark]: RCFGBuilder took 1026.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 206.3 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,945 INFO L168 Benchmark]: CodeCheck took 99402.71 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 872.7 MB in the beginning and 1.3 GB in the end (delta: -474.7 MB). Peak memory consumption was 951.3 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,945 INFO L168 Benchmark]: Witness Printer took 84.99 ms. Allocated memory is still 2.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-08 11:56:07,946 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, 198 locations, 1 error locations. UNSAFE Result, 99.2s OverallTime, 117 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1701702648 SDtfs, -196096994 SDslu, -1619297464 SDs, 0 SdLazy, -377786902 SolverSat, -316828320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 253.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104658 GetRequests, 102352 SyntacticMatches, 994 SemanticMatches, 1312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123071 ImplicationChecksByTransitivity, 88.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 14660 NumberOfCodeBlocks, 14660 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 14369 ConstructedInterpolants, 0 QuantifiedInterpolants, 5830723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 106 PerfectInterpolantSequences, 8144/8291 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: 428]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] return 24; VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] return 24; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1026.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 872.7 MB in the end (delta: 206.3 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. * CodeCheck took 99402.71 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 872.7 MB in the beginning and 1.3 GB in the end (delta: -474.7 MB). Peak memory consumption was 951.3 MB. Max. memory is 11.5 GB. * Witness Printer took 84.99 ms. Allocated memory is still 2.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...