./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/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 9606ace0ba404e813384772e5659d274b5d9d6a3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:17:39,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:17:39,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:17:39,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:17:39,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:17:39,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:17:39,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:17:39,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:17:39,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:17:39,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:17:39,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:17:39,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:17:39,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:17:39,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:17:39,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:17:39,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:17:39,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:17:39,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:17:39,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:17:39,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:17:39,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:17:39,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:17:39,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:17:39,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:17:39,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:17:39,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:17:39,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:17:39,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:17:39,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:17:39,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:17:39,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:17:39,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:17:39,928 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:17:39,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:17:39,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:17:39,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:17:39,931 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 23:17:39,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:17:39,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:17:39,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:17:39,943 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:17:39,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:17:39,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:17:39,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:17:39,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:17:39,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:17:39,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:17:39,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:17:39,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:17:39,945 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 23:17:39,945 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 23:17:39,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:17:39,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 23:17:39,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:17:39,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:17:39,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/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 -> 9606ace0ba404e813384772e5659d274b5d9d6a3 [2018-10-26 23:17:39,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:17:39,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:17:39,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:17:39,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:17:39,995 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:17:39,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-10-26 23:17:40,040 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/data/66e5811b4/e1842a476967413ead517eaa7530cf4e/FLAGf89a43eb1 [2018-10-26 23:17:40,472 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:17:40,477 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-10-26 23:17:40,488 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/data/66e5811b4/e1842a476967413ead517eaa7530cf4e/FLAGf89a43eb1 [2018-10-26 23:17:40,506 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/data/66e5811b4/e1842a476967413ead517eaa7530cf4e [2018-10-26 23:17:40,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:17:40,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:17:40,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:17:40,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:17:40,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:17:40,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:17:40" (1/1) ... [2018-10-26 23:17:40,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0a44c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:40, skipping insertion in model container [2018-10-26 23:17:40,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:17:40" (1/1) ... [2018-10-26 23:17:40,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:17:40,580 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:17:40,984 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:17:40,994 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:17:41,188 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:17:41,208 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:17:41,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41 WrapperNode [2018-10-26 23:17:41,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:17:41,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:17:41,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:17:41,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:17:41,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:17:41,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:17:41,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:17:41,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:17:41,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... [2018-10-26 23:17:41,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:17:41,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:17:41,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:17:41,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:17:41,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/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 23:17:41,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:17:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:17:44,963 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:17:44,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:17:44 BoogieIcfgContainer [2018-10-26 23:17:44,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:17:44,964 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 23:17:44,964 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 23:17:44,973 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 23:17:44,973 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:17:44" (1/1) ... [2018-10-26 23:17:44,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 237 states and 420 transitions. [2018-10-26 23:17:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 420 transitions. [2018-10-26 23:17:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 23:17:45,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:45,906 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-10-26 23:17:46,142 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-26 23:17:46,364 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 23:17:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 248 states and 446 transitions. [2018-10-26 23:17:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 446 transitions. [2018-10-26 23:17:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:46,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:46,770 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 23:17:47,355 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 23:17:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 250 states and 450 transitions. [2018-10-26 23:17:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 450 transitions. [2018-10-26 23:17:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:47,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:47,700 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 23:17:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 261 states and 477 transitions. [2018-10-26 23:17:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 477 transitions. [2018-10-26 23:17:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:48,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:48,284 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 23:17:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 263 states and 479 transitions. [2018-10-26 23:17:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 479 transitions. [2018-10-26 23:17:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:48,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:48,598 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 23:17:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 270 states and 497 transitions. [2018-10-26 23:17:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2018-10-26 23:17:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:49,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:49,503 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 23:17:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 271 states and 498 transitions. [2018-10-26 23:17:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 498 transitions. [2018-10-26 23:17:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:17:49,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:49,609 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 23:17:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 271 states and 496 transitions. [2018-10-26 23:17:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 496 transitions. [2018-10-26 23:17:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:49,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:50,007 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 23:17:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 274 states and 504 transitions. [2018-10-26 23:17:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 504 transitions. [2018-10-26 23:17:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:52,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:53,706 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 23:17:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 279 states and 518 transitions. [2018-10-26 23:17:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 518 transitions. [2018-10-26 23:17:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:57,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:57,816 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 23:17:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 324 states and 612 transitions. [2018-10-26 23:17:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 612 transitions. [2018-10-26 23:17:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:58,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:58,557 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 23:17:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 322 states and 606 transitions. [2018-10-26 23:17:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 606 transitions. [2018-10-26 23:17:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:58,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:58,690 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 23:17:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 367 states and 699 transitions. [2018-10-26 23:17:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 699 transitions. [2018-10-26 23:17:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:59,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:59,186 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 23:17:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:17:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 365 states and 694 transitions. [2018-10-26 23:17:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 694 transitions. [2018-10-26 23:17:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:17:59,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:17:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:01,215 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 23:18:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 409 states and 785 transitions. [2018-10-26 23:18:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 785 transitions. [2018-10-26 23:18:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:18:06,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:06,503 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 23:18:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 408 states and 781 transitions. [2018-10-26 23:18:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 781 transitions. [2018-10-26 23:18:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:18:06,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:07,310 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 23:18:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 452 states and 873 transitions. [2018-10-26 23:18:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 873 transitions. [2018-10-26 23:18:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:18:08,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:08,804 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 23:18:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 451 states and 868 transitions. [2018-10-26 23:18:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 868 transitions. [2018-10-26 23:18:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:18:08,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:09,879 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 23:18:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 458 states and 886 transitions. [2018-10-26 23:18:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 886 transitions. [2018-10-26 23:18:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 23:18:15,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:15,049 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 23:18:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 458 states and 885 transitions. [2018-10-26 23:18:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 885 transitions. [2018-10-26 23:18:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:16,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:16,132 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 23:18:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 462 states and 891 transitions. [2018-10-26 23:18:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 891 transitions. [2018-10-26 23:18:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:17,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:17,037 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 23:18:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 466 states and 897 transitions. [2018-10-26 23:18:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 897 transitions. [2018-10-26 23:18:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:17,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:18,016 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 23:18:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 470 states and 904 transitions. [2018-10-26 23:18:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 904 transitions. [2018-10-26 23:18:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:20,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:20,059 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 23:18:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 472 states and 908 transitions. [2018-10-26 23:18:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 908 transitions. [2018-10-26 23:18:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:20,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:20,325 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 23:18:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 519 states and 1004 transitions. [2018-10-26 23:18:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1004 transitions. [2018-10-26 23:18:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:22,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:22,620 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 23:18:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 531 states and 1038 transitions. [2018-10-26 23:18:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1038 transitions. [2018-10-26 23:18:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:32,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:33,276 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 23:18:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 539 states and 1058 transitions. [2018-10-26 23:18:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1058 transitions. [2018-10-26 23:18:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:35,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:35,474 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 23:18:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 539 states and 1056 transitions. [2018-10-26 23:18:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1056 transitions. [2018-10-26 23:18:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:36,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:36,415 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 23:18:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 540 states and 1056 transitions. [2018-10-26 23:18:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1056 transitions. [2018-10-26 23:18:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:37,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:37,055 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 23:18:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 583 states and 1140 transitions. [2018-10-26 23:18:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1140 transitions. [2018-10-26 23:18:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:38,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:38,629 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 23:18:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 588 states and 1147 transitions. [2018-10-26 23:18:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1147 transitions. [2018-10-26 23:18:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:39,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:39,465 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 23:18:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 591 states and 1150 transitions. [2018-10-26 23:18:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1150 transitions. [2018-10-26 23:18:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:41,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:41,349 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 23:18:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 592 states and 1150 transitions. [2018-10-26 23:18:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1150 transitions. [2018-10-26 23:18:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:41,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:41,435 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 23:18:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 593 states and 1150 transitions. [2018-10-26 23:18:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1150 transitions. [2018-10-26 23:18:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:41,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:41,785 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 23:18:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 599 states and 1164 transitions. [2018-10-26 23:18:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1164 transitions. [2018-10-26 23:18:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:43,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:43,110 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 23:18:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 607 states and 1180 transitions. [2018-10-26 23:18:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1180 transitions. [2018-10-26 23:18:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:44,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:45,020 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 23:18:46,851 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 23:18:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 611 states and 1186 transitions. [2018-10-26 23:18:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1186 transitions. [2018-10-26 23:18:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:48,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:48,373 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 23:18:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:18:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 612 states and 1186 transitions. [2018-10-26 23:18:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1186 transitions. [2018-10-26 23:18:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:18:48,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:18:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:48,956 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 23:19:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 620 states and 1206 transitions. [2018-10-26 23:19:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1206 transitions. [2018-10-26 23:19:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:02,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:02,157 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 23:19:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 629 states and 1223 transitions. [2018-10-26 23:19:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1223 transitions. [2018-10-26 23:19:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:05,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:05,336 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 23:19:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 630 states and 1225 transitions. [2018-10-26 23:19:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1225 transitions. [2018-10-26 23:19:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:05,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:05,944 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 23:19:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 634 states and 1232 transitions. [2018-10-26 23:19:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1232 transitions. [2018-10-26 23:19:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:06,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:07,011 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 23:19:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 635 states and 1235 transitions. [2018-10-26 23:19:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1235 transitions. [2018-10-26 23:19:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:07,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:07,409 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 23:19:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 636 states and 1235 transitions. [2018-10-26 23:19:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1235 transitions. [2018-10-26 23:19:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:07,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:07,463 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 23:19:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 638 states and 1239 transitions. [2018-10-26 23:19:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1239 transitions. [2018-10-26 23:19:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:08,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:08,430 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 23:19:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 639 states and 1242 transitions. [2018-10-26 23:19:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1242 transitions. [2018-10-26 23:19:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:10,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:10,851 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 23:19:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 641 states and 1246 transitions. [2018-10-26 23:19:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1246 transitions. [2018-10-26 23:19:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:12,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:12,852 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 23:19:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 648 states and 1261 transitions. [2018-10-26 23:19:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1261 transitions. [2018-10-26 23:19:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:19:16,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:16,484 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 23:19:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 631 states and 1199 transitions. [2018-10-26 23:19:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1199 transitions. [2018-10-26 23:19:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:19:19,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:20,194 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 23:19:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 640 states and 1218 transitions. [2018-10-26 23:19:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1218 transitions. [2018-10-26 23:19:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:19:25,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:25,988 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 23:19:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 648 states and 1237 transitions. [2018-10-26 23:19:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1237 transitions. [2018-10-26 23:19:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:19:31,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:32,350 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 23:19:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:19:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 661 states and 1261 transitions. [2018-10-26 23:19:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1261 transitions. [2018-10-26 23:19:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:19:59,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:19:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:00,331 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 23:20:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 663 states and 1263 transitions. [2018-10-26 23:20:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1263 transitions. [2018-10-26 23:20:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:20:05,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:05,631 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 23:20:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 661 states and 1260 transitions. [2018-10-26 23:20:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1260 transitions. [2018-10-26 23:20:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:20:06,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:06,828 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 23:20:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 659 states and 1257 transitions. [2018-10-26 23:20:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1257 transitions. [2018-10-26 23:20:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:20:08,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:08,170 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 23:20:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 661 states and 1263 transitions. [2018-10-26 23:20:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1263 transitions. [2018-10-26 23:20:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:20:10,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:10,305 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 23:20:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 658 states and 1254 transitions. [2018-10-26 23:20:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1254 transitions. [2018-10-26 23:20:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:11,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:11,453 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 23:20:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 662 states and 1259 transitions. [2018-10-26 23:20:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1259 transitions. [2018-10-26 23:20:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:13,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:13,681 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 23:20:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 675 states and 1287 transitions. [2018-10-26 23:20:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1287 transitions. [2018-10-26 23:20:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:23,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:23,434 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 23:20:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 683 states and 1301 transitions. [2018-10-26 23:20:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1301 transitions. [2018-10-26 23:20:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:29,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:29,489 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 23:20:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 684 states and 1302 transitions. [2018-10-26 23:20:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1302 transitions. [2018-10-26 23:20:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:29,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:29,548 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 23:20:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 735 states and 1406 transitions. [2018-10-26 23:20:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1406 transitions. [2018-10-26 23:20:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:38,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:38,463 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 23:20:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 733 states and 1399 transitions. [2018-10-26 23:20:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1399 transitions. [2018-10-26 23:20:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:39,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:39,611 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 23:20:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 734 states and 1399 transitions. [2018-10-26 23:20:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1399 transitions. [2018-10-26 23:20:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:40,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:40,783 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 23:20:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 735 states and 1403 transitions. [2018-10-26 23:20:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1403 transitions. [2018-10-26 23:20:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:42,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:42,044 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 23:20:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 736 states and 1403 transitions. [2018-10-26 23:20:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1403 transitions. [2018-10-26 23:20:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:43,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:43,233 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 23:20:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 737 states and 1404 transitions. [2018-10-26 23:20:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1404 transitions. [2018-10-26 23:20:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:43,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:43,283 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 23:20:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 742 states and 1412 transitions. [2018-10-26 23:20:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1412 transitions. [2018-10-26 23:20:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:44,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:44,417 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 23:20:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 779 states and 1484 transitions. [2018-10-26 23:20:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1484 transitions. [2018-10-26 23:20:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:45,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:45,572 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 23:20:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 780 states and 1484 transitions. [2018-10-26 23:20:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1484 transitions. [2018-10-26 23:20:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:45,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:45,638 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 23:20:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 827 states and 1578 transitions. [2018-10-26 23:20:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1578 transitions. [2018-10-26 23:20:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:52,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:52,745 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 23:20:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 874 states and 1667 transitions. [2018-10-26 23:20:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1667 transitions. [2018-10-26 23:20:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:57,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:57,727 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 23:20:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 875 states and 1672 transitions. [2018-10-26 23:20:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1672 transitions. [2018-10-26 23:20:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:57,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:57,785 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 23:20:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:20:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 876 states and 1673 transitions. [2018-10-26 23:20:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1673 transitions. [2018-10-26 23:20:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:20:57,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:20:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:57,830 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 23:21:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 880 states and 1676 transitions. [2018-10-26 23:21:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1676 transitions. [2018-10-26 23:21:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:00,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:00,462 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 23:21:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 884 states and 1685 transitions. [2018-10-26 23:21:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1685 transitions. [2018-10-26 23:21:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:06,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:06,458 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 23:21:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 885 states and 1686 transitions. [2018-10-26 23:21:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1686 transitions. [2018-10-26 23:21:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:07,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:07,722 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 23:21:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 887 states and 1692 transitions. [2018-10-26 23:21:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1692 transitions. [2018-10-26 23:21:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:11,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:11,271 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 23:21:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 886 states and 1686 transitions. [2018-10-26 23:21:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1686 transitions. [2018-10-26 23:21:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:19,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:20,002 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 23:21:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 883 states and 1680 transitions. [2018-10-26 23:21:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1680 transitions. [2018-10-26 23:21:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:24,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:24,943 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 23:21:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 880 states and 1675 transitions. [2018-10-26 23:21:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1675 transitions. [2018-10-26 23:21:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:30,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:30,075 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 23:21:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 882 states and 1679 transitions. [2018-10-26 23:21:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1679 transitions. [2018-10-26 23:21:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:32,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:32,408 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 23:21:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 882 states and 1678 transitions. [2018-10-26 23:21:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1678 transitions. [2018-10-26 23:21:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:34,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:34,741 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 23:21:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 882 states and 1676 transitions. [2018-10-26 23:21:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1676 transitions. [2018-10-26 23:21:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:37,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:37,354 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 23:21:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 884 states and 1682 transitions. [2018-10-26 23:21:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1682 transitions. [2018-10-26 23:21:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:38,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:38,685 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 23:21:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 883 states and 1678 transitions. [2018-10-26 23:21:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1678 transitions. [2018-10-26 23:21:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:41,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:41,229 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 23:21:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 892 states and 1693 transitions. [2018-10-26 23:21:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1693 transitions. [2018-10-26 23:21:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:41,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:41,816 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 23:21:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 891 states and 1690 transitions. [2018-10-26 23:21:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1690 transitions. [2018-10-26 23:21:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:43,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:43,992 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 23:21:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 888 states and 1684 transitions. [2018-10-26 23:21:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1684 transitions. [2018-10-26 23:21:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:45,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:45,365 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 23:21:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 887 states and 1681 transitions. [2018-10-26 23:21:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1681 transitions. [2018-10-26 23:21:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:48,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:48,019 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 23:21:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 888 states and 1682 transitions. [2018-10-26 23:21:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1682 transitions. [2018-10-26 23:21:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:49,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:49,385 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 23:21:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 890 states and 1684 transitions. [2018-10-26 23:21:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1684 transitions. [2018-10-26 23:21:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:52,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:52,093 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 23:21:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 895 states and 1691 transitions. [2018-10-26 23:21:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1691 transitions. [2018-10-26 23:21:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:53,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:54,934 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 23:21:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:21:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 908 states and 1711 transitions. [2018-10-26 23:21:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1711 transitions. [2018-10-26 23:21:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:21:59,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:21:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:59,693 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 23:22:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 915 states and 1721 transitions. [2018-10-26 23:22:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1721 transitions. [2018-10-26 23:22:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:03,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:03,977 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 23:22:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 912 states and 1716 transitions. [2018-10-26 23:22:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1716 transitions. [2018-10-26 23:22:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:05,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:05,511 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 23:22:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 912 states and 1714 transitions. [2018-10-26 23:22:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1714 transitions. [2018-10-26 23:22:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:07,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:07,069 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 23:22:07,644 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 23:22:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 912 states and 1713 transitions. [2018-10-26 23:22:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1713 transitions. [2018-10-26 23:22:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:08,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:10,302 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 23:22:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 921 states and 1731 transitions. [2018-10-26 23:22:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1731 transitions. [2018-10-26 23:22:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:16,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:16,341 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 23:22:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 922 states and 1731 transitions. [2018-10-26 23:22:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1731 transitions. [2018-10-26 23:22:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:16,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:16,917 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 23:22:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 928 states and 1742 transitions. [2018-10-26 23:22:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1742 transitions. [2018-10-26 23:22:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:19,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:19,593 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 23:22:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 807 states and 1477 transitions. [2018-10-26 23:22:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1477 transitions. [2018-10-26 23:22:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:20,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:21,237 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 23:22:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 807 states and 1476 transitions. [2018-10-26 23:22:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1476 transitions. [2018-10-26 23:22:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:22,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:22,687 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 23:22:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 807 states and 1475 transitions. [2018-10-26 23:22:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1475 transitions. [2018-10-26 23:22:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:22:24,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:24,162 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 23:22:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 807 states and 1474 transitions. [2018-10-26 23:22:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1474 transitions. [2018-10-26 23:22:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:22:25,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:26,132 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 23:22:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 824 states and 1509 transitions. [2018-10-26 23:22:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1509 transitions. [2018-10-26 23:22:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:22:43,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:43,372 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 23:22:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 828 states and 1516 transitions. [2018-10-26 23:22:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1516 transitions. [2018-10-26 23:22:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:22:49,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:49,365 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 23:22:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 832 states and 1521 transitions. [2018-10-26 23:22:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1521 transitions. [2018-10-26 23:22:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:22:55,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:55,528 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 23:22:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:22:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 836 states and 1528 transitions. [2018-10-26 23:22:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1528 transitions. [2018-10-26 23:22:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:22:57,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:22:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:57,068 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 23:23:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 846 states and 1545 transitions. [2018-10-26 23:23:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1545 transitions. [2018-10-26 23:23:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:03,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:03,458 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 23:23:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 849 states and 1547 transitions. [2018-10-26 23:23:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1547 transitions. [2018-10-26 23:23:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:05,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:05,045 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 23:23:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 852 states and 1551 transitions. [2018-10-26 23:23:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1551 transitions. [2018-10-26 23:23:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:06,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:06,434 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 23:23:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 857 states and 1558 transitions. [2018-10-26 23:23:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1558 transitions. [2018-10-26 23:23:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:09,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:09,272 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 23:23:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 870 states and 1577 transitions. [2018-10-26 23:23:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1577 transitions. [2018-10-26 23:23:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:16,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:16,330 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 23:23:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 871 states and 1578 transitions. [2018-10-26 23:23:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1578 transitions. [2018-10-26 23:23:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:16,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:16,364 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 23:23:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 878 states and 1594 transitions. [2018-10-26 23:23:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1594 transitions. [2018-10-26 23:23:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:24,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:24,979 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 23:23:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 882 states and 1599 transitions. [2018-10-26 23:23:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1599 transitions. [2018-10-26 23:23:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:29,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:29,654 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 23:23:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 895 states and 1624 transitions. [2018-10-26 23:23:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1624 transitions. [2018-10-26 23:23:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:38,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:38,934 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 23:23:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 899 states and 1629 transitions. [2018-10-26 23:23:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1629 transitions. [2018-10-26 23:23:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:43,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:43,638 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 23:23:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:23:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 905 states and 1636 transitions. [2018-10-26 23:23:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1636 transitions. [2018-10-26 23:23:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:23:55,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:23:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:55,620 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 23:24:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 880 states and 1596 transitions. [2018-10-26 23:24:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1596 transitions. [2018-10-26 23:24:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:24:01,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:01,892 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 23:24:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 888 states and 1607 transitions. [2018-10-26 23:24:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1607 transitions. [2018-10-26 23:24:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:24:08,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:08,109 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 23:24:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 888 states and 1604 transitions. [2018-10-26 23:24:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1604 transitions. [2018-10-26 23:24:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:24:10,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:10,276 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 23:24:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 888 states and 1603 transitions. [2018-10-26 23:24:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1603 transitions. [2018-10-26 23:24:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:24:12,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:12,295 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 23:24:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 885 states and 1596 transitions. [2018-10-26 23:24:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1596 transitions. [2018-10-26 23:24:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 23:24:20,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:20,568 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 23:24:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 897 states and 1613 transitions. [2018-10-26 23:24:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1613 transitions. [2018-10-26 23:24:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:24:28,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:29,186 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 23:24:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 901 states and 1618 transitions. [2018-10-26 23:24:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1618 transitions. [2018-10-26 23:24:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:24:34,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:34,154 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 23:24:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 944 states and 1701 transitions. [2018-10-26 23:24:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1701 transitions. [2018-10-26 23:24:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:24:34,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:35,003 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 23:24:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:24:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 948 states and 1710 transitions. [2018-10-26 23:24:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1710 transitions. [2018-10-26 23:24:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:24:41,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:24:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:43,340 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 23:25:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 952 states and 1722 transitions. [2018-10-26 23:25:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1722 transitions. [2018-10-26 23:25:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:25:33,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:33,390 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 23:25:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:25:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 948 states and 1711 transitions. [2018-10-26 23:25:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1711 transitions. [2018-10-26 23:25:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:25:39,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:25:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:39,915 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 23:25:44,266 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-10-26 23:26:19,110 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-26 23:26:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:26:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 963 states and 1737 transitions. [2018-10-26 23:26:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1737 transitions. [2018-10-26 23:26:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:26:40,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:26:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:40,239 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 23:26:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:26:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 971 states and 1751 transitions. [2018-10-26 23:26:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1751 transitions. [2018-10-26 23:26:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:26:51,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:26:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:51,728 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 23:26:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:26:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 973 states and 1752 transitions. [2018-10-26 23:26:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1752 transitions. [2018-10-26 23:26:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:26:59,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:26:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:26:59,924 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 23:27:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1016 states and 1832 transitions. [2018-10-26 23:27:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1832 transitions. [2018-10-26 23:27:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:03,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:04,017 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 23:27:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1016 states and 1829 transitions. [2018-10-26 23:27:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1829 transitions. [2018-10-26 23:27:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:11,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:12,263 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 23:27:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1018 states and 1831 transitions. [2018-10-26 23:27:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1831 transitions. [2018-10-26 23:27:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:16,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:16,643 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 23:27:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1019 states and 1832 transitions. [2018-10-26 23:27:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1832 transitions. [2018-10-26 23:27:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:16,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:16,683 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 23:27:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1023 states and 1836 transitions. [2018-10-26 23:27:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1836 transitions. [2018-10-26 23:27:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:22,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:22,369 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 23:27:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1015 states and 1823 transitions. [2018-10-26 23:27:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1823 transitions. [2018-10-26 23:27:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:24,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:24,718 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 23:27:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 950 states and 1693 transitions. [2018-10-26 23:27:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1693 transitions. [2018-10-26 23:27:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:27:30,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:30,355 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 23:27:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 903 states and 1605 transitions. [2018-10-26 23:27:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1605 transitions. [2018-10-26 23:27:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:27:32,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:32,987 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 23:27:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 912 states and 1615 transitions. [2018-10-26 23:27:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1615 transitions. [2018-10-26 23:27:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:27:41,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:41,388 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 23:27:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 916 states and 1621 transitions. [2018-10-26 23:27:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1621 transitions. [2018-10-26 23:27:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:27:54,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:54,087 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 23:27:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 920 states and 1626 transitions. [2018-10-26 23:27:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1626 transitions. [2018-10-26 23:27:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:27:55,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:27:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:27:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:27:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:27:56,179 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 145 iterations. [2018-10-26 23:27:56,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 11:27:56 ImpRootNode [2018-10-26 23:27:56,396 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 23:27:56,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:27:56,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:27:56,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:27:56,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:17:44" (3/4) ... [2018-10-26 23:27:56,399 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:27:56,615 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_032c4de6-f807-462b-b627-8475b76dde2e/bin-2019/ukojak/witness.graphml [2018-10-26 23:27:56,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:27:56,618 INFO L168 Benchmark]: Toolchain (without parser) took 616108.29 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 959.1 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,618 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:27:56,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 926.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,622 INFO L168 Benchmark]: Boogie Preprocessor took 58.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,622 INFO L168 Benchmark]: RCFGBuilder took 3526.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 285.1 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,623 INFO L168 Benchmark]: CodeCheck took 611432.28 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 792.1 MB in the beginning and 3.2 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,623 INFO L168 Benchmark]: Witness Printer took 220.61 ms. Allocated memory is still 4.7 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:27:56,624 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, 331 locations, 1 error locations. UNSAFE Result, 611.1s OverallTime, 145 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1783114984 SDtfs, -31642356 SDslu, -772165108 SDs, 0 SdLazy, 509820212 SolverSat, 172142976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 321.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141340 GetRequests, 138166 SyntacticMatches, 1332 SemanticMatches, 1842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770178 ImplicationChecksByTransitivity, 596.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 17841 NumberOfCodeBlocks, 17841 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 17568 ConstructedInterpolants, 0 QuantifiedInterpolants, 7372492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 144 InterpolantComputations, 144 PerfectInterpolantSequences, 0/0 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: 897]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L68] int __return_1868; [L69] int __return_2014; [L70] int __return_2147; [L71] int __return_2263; [L72] int __return_2401; [L73] int __return_2526; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L17] port_t p13 = 0; [L21] port_t p21 = 0; [L25] port_t p23 = 0; [L29] port_t p31 = 0; [L33] port_t p32 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L76] int main__c1; [L77] int main__i2; [L78] main__c1 = 0 [L79] ep12 = __VERIFIER_nondet_bool() [L80] ep13 = __VERIFIER_nondet_bool() [L81] ep21 = __VERIFIER_nondet_bool() [L82] ep23 = __VERIFIER_nondet_bool() [L83] ep31 = __VERIFIER_nondet_bool() [L84] ep32 = __VERIFIER_nondet_bool() [L85] id1 = __VERIFIER_nondet_char() [L86] r1 = __VERIFIER_nondet_uchar() [L87] st1 = __VERIFIER_nondet_char() [L88] nl1 = __VERIFIER_nondet_char() [L89] m1 = __VERIFIER_nondet_char() [L90] max1 = __VERIFIER_nondet_char() [L91] mode1 = __VERIFIER_nondet_bool() [L92] newmax1 = __VERIFIER_nondet_bool() [L93] id2 = __VERIFIER_nondet_char() [L94] r2 = __VERIFIER_nondet_uchar() [L95] st2 = __VERIFIER_nondet_char() [L96] nl2 = __VERIFIER_nondet_char() [L97] m2 = __VERIFIER_nondet_char() [L98] max2 = __VERIFIER_nondet_char() [L99] mode2 = __VERIFIER_nondet_bool() [L100] newmax2 = __VERIFIER_nondet_bool() [L101] id3 = __VERIFIER_nondet_char() [L102] r3 = __VERIFIER_nondet_uchar() [L103] st3 = __VERIFIER_nondet_char() [L104] nl3 = __VERIFIER_nondet_char() [L105] m3 = __VERIFIER_nondet_char() [L106] max3 = __VERIFIER_nondet_char() [L107] mode3 = __VERIFIER_nondet_bool() [L108] newmax3 = __VERIFIER_nondet_bool() [L110] _Bool init__r121; [L111] _Bool init__r131; [L112] _Bool init__r211; [L113] _Bool init__r231; [L114] _Bool init__r311; [L115] _Bool init__r321; [L116] _Bool init__r122; [L117] int init__tmp; [L118] _Bool init__r132; [L119] int init__tmp___0; [L120] _Bool init__r212; [L121] int init__tmp___1; [L122] _Bool init__r232; [L123] int init__tmp___2; [L124] _Bool init__r312; [L125] int init__tmp___3; [L126] _Bool init__r322; [L127] int init__tmp___4; [L128] int init__tmp___5; [L129] init__r121 = ep12 [L130] init__r131 = ep13 [L131] init__r211 = ep21 [L132] init__r231 = ep23 [L133] init__r311 = ep31 [L134] init__r321 = ep32 [L135] COND FALSE !(!(init__r121 == 0)) [L2423] COND TRUE !(init__r131 == 0) [L2425] COND TRUE !(ep32 == 0) [L2427] init__tmp = 1 [L139] init__r122 = (_Bool)init__tmp [L140] COND TRUE !(init__r131 == 0) [L142] init__tmp___0 = 1 [L144] init__r132 = (_Bool)init__tmp___0 [L145] COND TRUE !(init__r211 == 0) [L147] init__tmp___1 = 1 [L149] init__r212 = (_Bool)init__tmp___1 [L150] COND FALSE !(!(init__r231 == 0)) [L2354] COND TRUE !(init__r211 == 0) [L2356] COND TRUE !(ep13 == 0) [L2358] init__tmp___2 = 1 [L154] init__r232 = (_Bool)init__tmp___2 [L155] COND FALSE !(!(init__r311 == 0)) [L2331] COND TRUE !(init__r321 == 0) [L2333] COND TRUE !(ep21 == 0) [L2335] init__tmp___3 = 1 [L159] init__r312 = (_Bool)init__tmp___3 [L160] COND TRUE !(init__r321 == 0) [L162] init__tmp___4 = 1 [L164] init__r322 = (_Bool)init__tmp___4 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id1) >= 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id2) >= 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id3) >= 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r1) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r2) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)r3) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r122 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r132 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r212 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r232 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r312 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r322 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)st1) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st2) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)st3) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)nl1) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl2) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)nl3) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)mode1) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode2) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)mode3) == 0 VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE !(newmax1 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE !(newmax2 == 0) VAL [__return_1868=0, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE !(newmax3 == 0) [L225] init__tmp___5 = 1 [L226] __return_1868 = init__tmp___5 [L227] main__i2 = __return_1868 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE main__i2 != 0 [L230] p12_old = nomsg [L231] p12_new = nomsg [L232] p13_old = nomsg [L233] p13_new = nomsg [L234] p21_old = nomsg [L235] p21_new = nomsg [L236] p23_old = nomsg [L237] p23_new = nomsg [L238] p31_old = nomsg [L239] p31_new = nomsg [L240] p32_old = nomsg [L241] p32_new = nomsg [L242] main__i2 = 0 [L244] _Bool node1__newmax; [L245] node1__newmax = 0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND FALSE !(!(mode1 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE ((int)r1) < 1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep12 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE !(ep13 == 0) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND TRUE !(newmax1 == 0) [L271] int node1____CPAchecker_TMP_1; VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE max1 != nomsg VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND TRUE p13_new == nomsg [L276] node1____CPAchecker_TMP_1 = max1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] mode1 = 1 [L282] _Bool node2__newmax; [L283] node2__newmax = 0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND FALSE !(!(mode2 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] COND TRUE ((int)r2) < 2 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] COND TRUE !(ep21 == 0) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L294] COND TRUE !(newmax2 == 0) [L296] int node2____CPAchecker_TMP_0; VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] COND TRUE max2 != nomsg VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND TRUE p21_new == nomsg [L301] node2____CPAchecker_TMP_0 = max2 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND FALSE !(!(ep23 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] mode2 = 1 [L320] _Bool node3__newmax; [L321] node3__newmax = 0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L322] COND FALSE !(!(mode3 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L328] COND TRUE ((int)r3) < 2 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L330] COND FALSE !(!(ep31 == 0)) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE !(ep32 == 0) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE !(newmax3 == 0) [L347] int node3____CPAchecker_TMP_1; VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE max3 != nomsg VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND TRUE p32_new == nomsg [L352] node3____CPAchecker_TMP_1 = max3 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=0, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=122, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] mode3 = 1 [L357] p12_old = p12_new [L358] p12_new = nomsg [L359] p13_old = p13_new [L360] p13_new = nomsg [L361] p21_old = p21_new [L362] p21_new = nomsg [L363] p23_old = p23_new [L364] p23_new = nomsg [L365] p31_old = p31_new [L366] p31_new = nomsg [L367] p32_old = p32_new [L368] p32_new = nomsg [L370] int check__tmp; VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L379] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE ((int)r1) < 2 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1868=1, __return_2014=0, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND TRUE ((int)r1) < 2 [L399] check__tmp = 1 [L400] __return_2014 = check__tmp [L401] main__c1 = __return_2014 [L403] _Bool __tmp_1; [L404] __tmp_1 = main__c1 [L405] _Bool assert__arg; [L406] assert__arg = __tmp_1 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND FALSE !(assert__arg == 0) [L414] _Bool node1__newmax; [L415] node1__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE !(mode1 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-128, m2=126, m3=-128, max1=0, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND FALSE !(r1 == 255) [L424] r1 = r1 + 1 [L425] COND TRUE !(ep21 == 0) [L427] m1 = p21_old [L428] p21_old = nomsg [L429] COND TRUE ((int)m1) > ((int)max1) [L431] max1 = m1 [L432] node1__newmax = 1 [L434] COND FALSE !(!(ep31 == 0)) [L443] newmax1 = node1__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=126, m3=-128, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L444] COND FALSE !(((int)r1) == 2) [L450] mode1 = 0 [L452] _Bool node2__newmax; [L453] node2__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=126, m3=-128, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE !(mode2 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=126, m3=-128, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND FALSE !(r2 == 255) [L462] r2 = r2 + 1 [L463] COND FALSE !(!(ep12 == 0)) [L472] COND TRUE !(ep32 == 0) [L474] m2 = p32_old [L475] p32_old = nomsg [L476] COND FALSE !(((int)m2) > ((int)max2)) [L481] newmax2 = node2__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=-128, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L482] COND FALSE !(((int)r2) == 2) [L488] mode2 = 0 [L490] _Bool node3__newmax; [L491] node3__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=-128, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE !(mode3 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=-128, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L494] COND FALSE !(r3 == 255) [L500] r3 = r3 + 1 [L501] COND TRUE !(ep13 == 0) [L503] m3 = p13_old [L504] p13_old = nomsg [L505] COND FALSE !(((int)m3) > ((int)max3)) [L510] COND FALSE !(!(ep23 == 0)) [L519] newmax3 = node3__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND FALSE !(((int)r3) == 2) [L526] mode3 = 0 [L527] p12_old = p12_new [L528] p12_new = nomsg [L529] p13_old = p13_new [L530] p13_new = nomsg [L531] p21_old = p21_new [L532] p21_new = nomsg [L533] p23_old = p23_new [L534] p23_new = nomsg [L535] p31_old = p31_new [L536] p31_new = nomsg [L537] p32_old = p32_new [L538] p32_new = nomsg [L540] int check__tmp; VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L543] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L547] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L549] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L555] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L557] COND TRUE ((int)r1) < 2 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L565] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1868=1, __return_2014=1, __return_2147=0, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L567] COND TRUE ((int)r1) < 2 [L569] check__tmp = 1 [L570] __return_2147 = check__tmp [L571] main__c1 = __return_2147 [L573] _Bool __tmp_2; [L574] __tmp_2 = main__c1 [L575] _Bool assert__arg; [L576] assert__arg = __tmp_2 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L577] COND FALSE !(assert__arg == 0) [L584] _Bool node1__newmax; [L585] node1__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] COND FALSE !(!(mode1 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L592] COND FALSE !(((int)r1) < 1) [L598] mode1 = 1 [L600] _Bool node2__newmax; [L601] node2__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L602] COND FALSE !(!(mode2 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L608] COND TRUE ((int)r2) < 2 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L610] COND TRUE !(ep21 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L612] COND FALSE !(!(newmax2 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L623] COND FALSE !(!(ep23 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L636] mode2 = 1 [L638] _Bool node3__newmax; [L639] node3__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L640] COND FALSE !(!(mode3 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L646] COND TRUE ((int)r3) < 2 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L648] COND FALSE !(!(ep31 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L661] COND TRUE !(ep32 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L663] COND FALSE !(!(newmax3 == 0)) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L674] mode3 = 1 [L675] p12_old = p12_new [L676] p12_new = nomsg [L677] p13_old = p13_new [L678] p13_new = nomsg [L679] p21_old = p21_new [L680] p21_new = nomsg [L681] p23_old = p23_new [L682] p23_new = nomsg [L683] p31_old = p31_new [L684] p31_new = nomsg [L685] p32_old = p32_new [L686] p32_new = nomsg [L688] int check__tmp; VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L689] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L691] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L693] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L695] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L697] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L703] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L705] COND TRUE ((int)r1) < 2 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L707] COND FALSE !(((int)r1) >= 2) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L713] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=0, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L715] COND TRUE ((int)r1) < 2 [L717] check__tmp = 1 [L718] __return_2263 = check__tmp [L719] main__c1 = __return_2263 [L721] _Bool __tmp_3; [L722] __tmp_3 = main__c1 [L723] _Bool assert__arg; [L724] assert__arg = __tmp_3 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L725] COND FALSE !(assert__arg == 0) [L732] _Bool node1__newmax; [L733] node1__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L734] COND TRUE !(mode1 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=127, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L736] COND FALSE !(r1 == 255) [L742] r1 = r1 + 1 [L743] COND TRUE !(ep21 == 0) [L745] m1 = p21_old [L746] p21_old = nomsg [L747] COND FALSE !(((int)m1) > ((int)max1)) [L752] COND FALSE !(!(ep31 == 0)) [L761] newmax1 = node1__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L762] COND TRUE ((int)r1) == 2 [L764] COND FALSE !(((int)max1) == ((int)id1)) [L1638] nl1 = 1 [L768] mode1 = 0 [L770] _Bool node2__newmax; [L771] node2__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L772] COND TRUE !(mode2 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=122, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L774] COND FALSE !(r2 == 255) [L780] r2 = r2 + 1 [L781] COND FALSE !(!(ep12 == 0)) [L790] COND TRUE !(ep32 == 0) [L792] m2 = p32_old [L793] p32_old = nomsg [L794] COND FALSE !(((int)m2) > ((int)max2)) [L799] newmax2 = node2__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L800] COND TRUE ((int)r2) == 2 [L802] COND TRUE ((int)max2) == ((int)id2) [L804] st2 = 1 [L806] mode2 = 0 [L808] _Bool node3__newmax; [L809] node3__newmax = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L810] COND TRUE !(mode3 == 0) VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=0, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L812] COND FALSE !(r3 == 255) [L818] r3 = r3 + 1 [L819] COND TRUE !(ep13 == 0) [L821] m3 = p13_old [L822] p13_old = nomsg [L823] COND FALSE !(((int)m3) > ((int)max3)) [L828] COND FALSE !(!(ep23 == 0)) [L837] newmax3 = node3__newmax VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L838] COND TRUE ((int)r3) == 2 [L840] COND TRUE ((int)max3) == ((int)id3) [L842] st3 = 1 [L844] mode3 = 0 [L845] p12_old = p12_new [L846] p12_new = nomsg [L847] p13_old = p13_new [L848] p13_new = nomsg [L849] p21_old = p21_new [L850] p21_new = nomsg [L851] p23_old = p23_new [L852] p23_new = nomsg [L853] p31_old = p31_new [L854] p31_new = nomsg [L855] p32_old = p32_new [L856] p32_new = nomsg [L858] int check__tmp; VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L859] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1555] check__tmp = 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L887] __return_2401 = check__tmp [L888] main__c1 = __return_2401 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L891] _Bool __tmp_4; [L892] __tmp_4 = main__c1 [L893] _Bool assert__arg; [L894] assert__arg = __tmp_4 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L895] COND TRUE assert__arg == 0 VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L897] __VERIFIER_error() VAL [__return_1868=1, __return_2014=1, __return_2147=1, __return_2263=1, __return_2401=0, __return_2526=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=122, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=122, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 926.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3526.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 285.1 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. * CodeCheck took 611432.28 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 792.1 MB in the beginning and 3.2 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 220.61 ms. Allocated memory is still 4.7 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 71.6 MB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...