./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/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 c88dc41bb0c5752717ba5895f8d33afd40276a61 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:21:31,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:21:31,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:21:32,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:21:32,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:21:32,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:21:32,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:21:32,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:21:32,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:21:32,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:21:32,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:21:32,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:21:32,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:21:32,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:21:32,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:21:32,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:21:32,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:21:32,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:21:32,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:21:32,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:21:32,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:21:32,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:21:32,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:21:32,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:21:32,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:21:32,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:21:32,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:21:32,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:21:32,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:21:32,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:21:32,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:21:32,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:21:32,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:21:32,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:21:32,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:21:32,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:21:32,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 20:21:32,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:21:32,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:21:32,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:21:32,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:21:32,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:21:32,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:21:32,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:21:32,065 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 20:21:32,065 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 20:21:32,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 20:21:32,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 20:21:32,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:21:32,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:21:32,067 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_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/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 -> c88dc41bb0c5752717ba5895f8d33afd40276a61 [2018-10-26 20:21:32,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:21:32,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:21:32,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:21:32,111 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:21:32,111 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:21:32,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-10-26 20:21:32,165 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/data/9c17bfef6/4d8ee93011ff4332a19910f8cfa0bf3f/FLAG372cce8bd [2018-10-26 20:21:32,620 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:21:32,631 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-10-26 20:21:32,655 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/data/9c17bfef6/4d8ee93011ff4332a19910f8cfa0bf3f/FLAG372cce8bd [2018-10-26 20:21:32,669 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/data/9c17bfef6/4d8ee93011ff4332a19910f8cfa0bf3f [2018-10-26 20:21:32,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:21:32,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:21:32,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:21:32,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:21:32,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:21:32,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:21:32" (1/1) ... [2018-10-26 20:21:32,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1932273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:32, skipping insertion in model container [2018-10-26 20:21:32,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:21:32" (1/1) ... [2018-10-26 20:21:32,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:21:32,751 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:21:33,088 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:21:33,092 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:21:33,184 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:21:33,207 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:21:33,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33 WrapperNode [2018-10-26 20:21:33,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:21:33,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:21:33,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:21:33,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:21:33,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:21:33,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:21:33,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:21:33,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:21:33,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... [2018-10-26 20:21:33,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:21:33,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:21:33,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:21:33,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:21:33,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/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-10-26 20:21:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:21:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:21:33,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:21:38,190 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:21:38,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:38 BoogieIcfgContainer [2018-10-26 20:21:38,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:21:38,192 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 20:21:38,192 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 20:21:38,204 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 20:21:38,205 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:38" (1/1) ... [2018-10-26 20:21:38,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-10-26 20:21:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-10-26 20:21:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 20:21:38,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-10-26 20:21:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-10-26 20:21:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 20:21:39,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 245 states and 339 transitions. [2018-10-26 20:21:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2018-10-26 20:21:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 20:21:40,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 250 states and 345 transitions. [2018-10-26 20:21:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2018-10-26 20:21:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 20:21:40,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 260 states and 360 transitions. [2018-10-26 20:21:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 360 transitions. [2018-10-26 20:21:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 20:21:41,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 263 states and 363 transitions. [2018-10-26 20:21:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2018-10-26 20:21:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 20:21:41,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 268 states and 370 transitions. [2018-10-26 20:21:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2018-10-26 20:21:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 20:21:41,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 273 states and 376 transitions. [2018-10-26 20:21:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2018-10-26 20:21:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 20:21:41,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 291 states and 402 transitions. [2018-10-26 20:21:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2018-10-26 20:21:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 20:21:42,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:21:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 292 states and 404 transitions. [2018-10-26 20:21:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2018-10-26 20:21:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 20:21:42,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:21:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 296 states and 408 transitions. [2018-10-26 20:21:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 408 transitions. [2018-10-26 20:21:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 20:21:42,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 300 states and 413 transitions. [2018-10-26 20:21:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 413 transitions. [2018-10-26 20:21:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 20:21:43,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 324 states and 445 transitions. [2018-10-26 20:21:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2018-10-26 20:21:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:21:43,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:44,369 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:21:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 326 states and 447 transitions. [2018-10-26 20:21:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 447 transitions. [2018-10-26 20:21:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 20:21:44,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:21:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 406 states and 530 transitions. [2018-10-26 20:21:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2018-10-26 20:21:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 20:21:45,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:46,724 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:21:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 429 states and 561 transitions. [2018-10-26 20:21:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 561 transitions. [2018-10-26 20:21:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 20:21:47,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 433 states and 565 transitions. [2018-10-26 20:21:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 565 transitions. [2018-10-26 20:21:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 20:21:47,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 437 states and 569 transitions. [2018-10-26 20:21:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 569 transitions. [2018-10-26 20:21:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 20:21:47,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 471 states and 616 transitions. [2018-10-26 20:21:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2018-10-26 20:21:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 20:21:49,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-10-26 20:21:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-10-26 20:21:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 20:21:49,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 20:21:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 477 states and 622 transitions. [2018-10-26 20:21:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 622 transitions. [2018-10-26 20:21:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:21:49,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 491 states and 642 transitions. [2018-10-26 20:21:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 642 transitions. [2018-10-26 20:21:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 20:21:50,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:21:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 498 states and 649 transitions. [2018-10-26 20:21:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 649 transitions. [2018-10-26 20:21:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 20:21:50,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:51,520 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:21:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 502 states and 653 transitions. [2018-10-26 20:21:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 653 transitions. [2018-10-26 20:21:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 20:21:51,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 20:21:52,427 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 20:21:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 509 states and 661 transitions. [2018-10-26 20:21:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2018-10-26 20:21:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 20:21:52,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:21:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 513 states and 668 transitions. [2018-10-26 20:21:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 668 transitions. [2018-10-26 20:21:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:21:53,089 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 537 states and 700 transitions. [2018-10-26 20:21:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-10-26 20:21:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:21:54,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 543 states and 706 transitions. [2018-10-26 20:21:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 706 transitions. [2018-10-26 20:21:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:21:55,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:56,180 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 20:21:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 547 states and 709 transitions. [2018-10-26 20:21:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2018-10-26 20:21:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:21:56,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:21:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 548 states and 710 transitions. [2018-10-26 20:21:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 710 transitions. [2018-10-26 20:21:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:21:56,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:21:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 549 states and 711 transitions. [2018-10-26 20:21:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 711 transitions. [2018-10-26 20:21:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 20:21:56,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:21:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:21:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 570 states and 733 transitions. [2018-10-26 20:21:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 733 transitions. [2018-10-26 20:21:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 20:21:57,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:21:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 589 states and 759 transitions. [2018-10-26 20:22:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 759 transitions. [2018-10-26 20:22:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 20:22:02,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 593 states and 763 transitions. [2018-10-26 20:22:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 763 transitions. [2018-10-26 20:22:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 20:22:03,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 609 states and 781 transitions. [2018-10-26 20:22:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 781 transitions. [2018-10-26 20:22:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 20:22:03,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:22:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 618 states and 791 transitions. [2018-10-26 20:22:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 791 transitions. [2018-10-26 20:22:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 20:22:03,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 620 states and 793 transitions. [2018-10-26 20:22:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 793 transitions. [2018-10-26 20:22:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 20:22:03,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 20:22:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 622 states and 794 transitions. [2018-10-26 20:22:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 794 transitions. [2018-10-26 20:22:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 20:22:03,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:22:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 629 states and 804 transitions. [2018-10-26 20:22:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 804 transitions. [2018-10-26 20:22:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-26 20:22:04,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:22:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 633 states and 809 transitions. [2018-10-26 20:22:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 809 transitions. [2018-10-26 20:22:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 20:22:04,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 637 states and 815 transitions. [2018-10-26 20:22:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 815 transitions. [2018-10-26 20:22:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 20:22:05,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 639 states and 817 transitions. [2018-10-26 20:22:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2018-10-26 20:22:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 20:22:05,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 640 states and 818 transitions. [2018-10-26 20:22:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 818 transitions. [2018-10-26 20:22:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 20:22:05,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:22:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 692 states and 877 transitions. [2018-10-26 20:22:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 877 transitions. [2018-10-26 20:22:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 20:22:06,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 693 states and 878 transitions. [2018-10-26 20:22:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 878 transitions. [2018-10-26 20:22:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 20:22:06,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:22:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 699 states and 885 transitions. [2018-10-26 20:22:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2018-10-26 20:22:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 20:22:07,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 700 states and 887 transitions. [2018-10-26 20:22:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 887 transitions. [2018-10-26 20:22:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 20:22:07,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:22:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 706 states and 892 transitions. [2018-10-26 20:22:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 892 transitions. [2018-10-26 20:22:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-26 20:22:08,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 20:22:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 712 states and 899 transitions. [2018-10-26 20:22:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 899 transitions. [2018-10-26 20:22:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 20:22:08,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 730 states and 920 transitions. [2018-10-26 20:22:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 920 transitions. [2018-10-26 20:22:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 20:22:09,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 20:22:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 734 states and 923 transitions. [2018-10-26 20:22:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 923 transitions. [2018-10-26 20:22:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 20:22:09,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 763 states and 955 transitions. [2018-10-26 20:22:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 955 transitions. [2018-10-26 20:22:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 20:22:09,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 782 states and 977 transitions. [2018-10-26 20:22:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 977 transitions. [2018-10-26 20:22:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 20:22:11,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 783 states and 978 transitions. [2018-10-26 20:22:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 978 transitions. [2018-10-26 20:22:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 20:22:11,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 20:22:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 789 states and 983 transitions. [2018-10-26 20:22:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 983 transitions. [2018-10-26 20:22:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 20:22:11,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 811 states and 1013 transitions. [2018-10-26 20:22:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1013 transitions. [2018-10-26 20:22:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 20:22:13,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 815 states and 1017 transitions. [2018-10-26 20:22:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1017 transitions. [2018-10-26 20:22:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 20:22:13,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 818 states and 1020 transitions. [2018-10-26 20:22:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1020 transitions. [2018-10-26 20:22:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 20:22:14,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 843 states and 1046 transitions. [2018-10-26 20:22:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1046 transitions. [2018-10-26 20:22:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 20:22:15,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 861 states and 1063 transitions. [2018-10-26 20:22:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1063 transitions. [2018-10-26 20:22:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 20:22:16,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 878 states and 1087 transitions. [2018-10-26 20:22:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1087 transitions. [2018-10-26 20:22:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 20:22:17,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 882 states and 1091 transitions. [2018-10-26 20:22:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1091 transitions. [2018-10-26 20:22:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 20:22:17,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 886 states and 1095 transitions. [2018-10-26 20:22:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1095 transitions. [2018-10-26 20:22:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 20:22:17,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 904 states and 1117 transitions. [2018-10-26 20:22:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1117 transitions. [2018-10-26 20:22:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 20:22:18,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 906 states and 1119 transitions. [2018-10-26 20:22:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1119 transitions. [2018-10-26 20:22:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 20:22:19,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 910 states and 1122 transitions. [2018-10-26 20:22:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1122 transitions. [2018-10-26 20:22:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 20:22:19,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 20:22:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1007 states and 1222 transitions. [2018-10-26 20:22:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1222 transitions. [2018-10-26 20:22:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 20:22:20,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:22:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1008 states and 1222 transitions. [2018-10-26 20:22:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1222 transitions. [2018-10-26 20:22:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 20:22:20,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1030 states and 1245 transitions. [2018-10-26 20:22:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1245 transitions. [2018-10-26 20:22:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 20:22:21,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 20:22:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1035 states and 1250 transitions. [2018-10-26 20:22:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1250 transitions. [2018-10-26 20:22:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 20:22:21,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1047 states and 1265 transitions. [2018-10-26 20:22:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1265 transitions. [2018-10-26 20:22:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 20:22:22,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1051 states and 1270 transitions. [2018-10-26 20:22:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1270 transitions. [2018-10-26 20:22:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 20:22:22,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 20:22:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1060 states and 1282 transitions. [2018-10-26 20:22:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1282 transitions. [2018-10-26 20:22:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 20:22:24,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 20:22:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1074 states and 1296 transitions. [2018-10-26 20:22:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1296 transitions. [2018-10-26 20:22:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 20:22:24,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 20:22:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1078 states and 1299 transitions. [2018-10-26 20:22:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1299 transitions. [2018-10-26 20:22:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:22:25,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1094 states and 1325 transitions. [2018-10-26 20:22:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1325 transitions. [2018-10-26 20:22:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:22:27,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 20:22:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1107 states and 1337 transitions. [2018-10-26 20:22:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1337 transitions. [2018-10-26 20:22:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:22:27,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1115 states and 1346 transitions. [2018-10-26 20:22:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1346 transitions. [2018-10-26 20:22:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 20:22:28,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 20:22:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1116 states and 1346 transitions. [2018-10-26 20:22:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1346 transitions. [2018-10-26 20:22:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 20:22:28,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1141 states and 1371 transitions. [2018-10-26 20:22:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1371 transitions. [2018-10-26 20:22:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 20:22:29,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 20:22:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1147 states and 1376 transitions. [2018-10-26 20:22:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1376 transitions. [2018-10-26 20:22:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 20:22:29,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 20:22:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1186 states and 1420 transitions. [2018-10-26 20:22:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1420 transitions. [2018-10-26 20:22:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 20:22:31,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 20:22:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1200 states and 1434 transitions. [2018-10-26 20:22:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1434 transitions. [2018-10-26 20:22:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:22:31,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:22:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1206 states and 1439 transitions. [2018-10-26 20:22:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1439 transitions. [2018-10-26 20:22:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 20:22:31,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:22:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1209 states and 1441 transitions. [2018-10-26 20:22:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1441 transitions. [2018-10-26 20:22:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 20:22:31,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:22:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1220 states and 1458 transitions. [2018-10-26 20:22:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1458 transitions. [2018-10-26 20:22:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 20:22:33,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:22:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1224 states and 1463 transitions. [2018-10-26 20:22:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1463 transitions. [2018-10-26 20:22:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 20:22:33,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1255 states and 1494 transitions. [2018-10-26 20:22:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1494 transitions. [2018-10-26 20:22:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 20:22:34,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-26 20:22:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1287 states and 1528 transitions. [2018-10-26 20:22:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1528 transitions. [2018-10-26 20:22:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 20:22:34,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1307 states and 1552 transitions. [2018-10-26 20:22:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1552 transitions. [2018-10-26 20:22:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:22:35,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:22:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1312 states and 1561 transitions. [2018-10-26 20:22:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1561 transitions. [2018-10-26 20:22:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:22:36,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 20:22:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1315 states and 1563 transitions. [2018-10-26 20:22:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1563 transitions. [2018-10-26 20:22:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:22:37,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 104 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:22:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1334 states and 1583 transitions. [2018-10-26 20:22:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1583 transitions. [2018-10-26 20:22:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:22:37,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 104 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:22:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1346 states and 1597 transitions. [2018-10-26 20:22:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1597 transitions. [2018-10-26 20:22:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:22:38,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 104 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:22:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1350 states and 1601 transitions. [2018-10-26 20:22:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1601 transitions. [2018-10-26 20:22:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 20:22:39,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 126 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-26 20:22:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1412 states and 1668 transitions. [2018-10-26 20:22:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1668 transitions. [2018-10-26 20:22:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 20:22:41,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 20:22:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1427 states and 1683 transitions. [2018-10-26 20:22:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1683 transitions. [2018-10-26 20:22:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 20:22:41,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 20:22:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1438 states and 1697 transitions. [2018-10-26 20:22:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1697 transitions. [2018-10-26 20:22:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:42,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1453 states and 1712 transitions. [2018-10-26 20:22:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1712 transitions. [2018-10-26 20:22:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:42,912 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1463 states and 1726 transitions. [2018-10-26 20:22:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1726 transitions. [2018-10-26 20:22:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:43,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1467 states and 1730 transitions. [2018-10-26 20:22:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1730 transitions. [2018-10-26 20:22:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:43,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 120 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 20:22:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1471 states and 1734 transitions. [2018-10-26 20:22:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1734 transitions. [2018-10-26 20:22:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:44,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 20:22:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1488 states and 1750 transitions. [2018-10-26 20:22:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1750 transitions. [2018-10-26 20:22:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:44,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:22:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1504 states and 1772 transitions. [2018-10-26 20:22:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1772 transitions. [2018-10-26 20:22:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:22:45,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:22:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1513 states and 1781 transitions. [2018-10-26 20:22:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1781 transitions. [2018-10-26 20:22:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:22:46,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 20:22:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1520 states and 1790 transitions. [2018-10-26 20:22:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1790 transitions. [2018-10-26 20:22:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:22:47,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 20:22:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1543 states and 1812 transitions. [2018-10-26 20:22:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1812 transitions. [2018-10-26 20:22:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:22:47,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1581 states and 1852 transitions. [2018-10-26 20:22:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1852 transitions. [2018-10-26 20:22:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:22:48,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 20:22:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1582 states and 1852 transitions. [2018-10-26 20:22:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1852 transitions. [2018-10-26 20:22:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:22:48,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 20:22:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:22:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1585 states and 1854 transitions. [2018-10-26 20:22:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1854 transitions. [2018-10-26 20:22:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-26 20:22:48,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:22:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:48,908 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-10-26 20:22:49,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 08:22:49 ImpRootNode [2018-10-26 20:22:49,099 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 20:22:49,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:22:49,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:22:49,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:22:49,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:38" (3/4) ... [2018-10-26 20:22:49,105 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:22:49,344 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_04f2240b-1aa9-4d1e-8cdb-da4079a713e5/bin-2019/ukojak/witness.graphml [2018-10-26 20:22:49,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:22:49,345 INFO L168 Benchmark]: Toolchain (without parser) took 76671.84 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 955.3 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,345 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:22:49,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.83 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 925.7 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.14 ms. Allocated memory is still 1.0 GB. Free memory was 925.7 MB in the beginning and 920.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,346 INFO L168 Benchmark]: Boogie Preprocessor took 157.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 920.4 MB in the beginning and 1.1 GB in the end (delta: -229.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,346 INFO L168 Benchmark]: RCFGBuilder took 4748.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.0 MB in the end (delta: 240.4 MB). Peak memory consumption was 240.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,346 INFO L168 Benchmark]: CodeCheck took 70907.38 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.6 MB). Free memory was 909.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 977.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,346 INFO L168 Benchmark]: Witness Printer took 244.46 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:49,352 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 228 locations, 1 error locations. UNSAFE Result, 70.6s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1187487104 SDtfs, -693780440 SDslu, 969212288 SDs, 0 SdLazy, 1100571944 SolverSat, -988868104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 414.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104457 GetRequests, 103191 SyntacticMatches, 586 SemanticMatches, 680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310489 ImplicationChecksByTransitivity, 56.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 16650 NumberOfCodeBlocks, 16650 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 16327 ConstructedInterpolants, 0 QuantifiedInterpolants, 5257408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 89 PerfectInterpolantSequences, 10967/11158 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: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] RET return -1; VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 540.83 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 925.7 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.14 ms. Allocated memory is still 1.0 GB. Free memory was 925.7 MB in the beginning and 920.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 920.4 MB in the beginning and 1.1 GB in the end (delta: -229.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4748.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.0 MB in the end (delta: 240.4 MB). Peak memory consumption was 240.4 MB. Max. memory is 11.5 GB. * CodeCheck took 70907.38 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.6 MB). Free memory was 909.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 977.3 MB. Max. memory is 11.5 GB. * Witness Printer took 244.46 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...