./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_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/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_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/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-11-10 07:51:15,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:51:15,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:51:15,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:51:15,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:51:15,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:51:15,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:51:15,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:51:15,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:51:15,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:51:15,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:51:15,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:51:15,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:51:15,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:51:15,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:51:15,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:51:15,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:51:15,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:51:15,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:51:15,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:51:15,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:51:15,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:51:15,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:51:15,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:51:15,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:51:15,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:51:15,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:51:15,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:51:15,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:51:15,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:51:15,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:51:15,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:51:15,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:51:15,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:51:15,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:51:15,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:51:15,104 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:51:15,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:51:15,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:51:15,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:51:15,114 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:51:15,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:51:15,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:51:15,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:51:15,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:51:15,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:51:15,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:51:15,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:51:15,116 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:51:15,116 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:51:15,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:51:15,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:51:15,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:51:15,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:51:15,117 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_6d680cb7-7adf-44d6-a685-3f9423aa0049/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-11-10 07:51:15,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:51:15,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:51:15,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:51:15,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:51:15,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:51:15,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/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-11-10 07:51:15,197 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/data/514d89ce8/4942d987df5c4212b8b9086f67a637b2/FLAGdabc1e25b [2018-11-10 07:51:15,639 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:51:15,640 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-11-10 07:51:15,651 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/data/514d89ce8/4942d987df5c4212b8b9086f67a637b2/FLAGdabc1e25b [2018-11-10 07:51:15,662 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/data/514d89ce8/4942d987df5c4212b8b9086f67a637b2 [2018-11-10 07:51:15,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:51:15,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:51:15,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:15,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:51:15,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:51:15,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:15" (1/1) ... [2018-11-10 07:51:15,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3de601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:15, skipping insertion in model container [2018-11-10 07:51:15,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:15" (1/1) ... [2018-11-10 07:51:15,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:51:15,727 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:51:16,006 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:16,012 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:51:16,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:16,123 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:51:16,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16 WrapperNode [2018-11-10 07:51:16,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:16,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:16,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:51:16,124 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:51:16,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:16,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:51:16,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:51:16,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:51:16,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... [2018-11-10 07:51:16,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:51:16,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:51:16,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:51:16,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:51:16,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:51:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:51:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:51:17,734 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:51:17,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:17 BoogieIcfgContainer [2018-11-10 07:51:17,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:51:17,735 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:51:17,735 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:51:17,742 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:51:17,742 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:17" (1/1) ... [2018-11-10 07:51:17,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 237 states and 420 transitions. [2018-11-10 07:51:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 420 transitions. [2018-11-10 07:51:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 07:51:17,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 248 states and 446 transitions. [2018-11-10 07:51:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 446 transitions. [2018-11-10 07:51:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:18,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 250 states and 450 transitions. [2018-11-10 07:51:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 450 transitions. [2018-11-10 07:51:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:18,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 261 states and 477 transitions. [2018-11-10 07:51:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 477 transitions. [2018-11-10 07:51:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:19,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,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-11-10 07:51:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 263 states and 479 transitions. [2018-11-10 07:51:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 479 transitions. [2018-11-10 07:51:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:19,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 270 states and 497 transitions. [2018-11-10 07:51:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2018-11-10 07:51:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:20,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 271 states and 498 transitions. [2018-11-10 07:51:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 498 transitions. [2018-11-10 07:51:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:51:20,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 271 states and 496 transitions. [2018-11-10 07:51:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 496 transitions. [2018-11-10 07:51:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:20,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 274 states and 504 transitions. [2018-11-10 07:51:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 504 transitions. [2018-11-10 07:51:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:22,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 279 states and 518 transitions. [2018-11-10 07:51:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 518 transitions. [2018-11-10 07:51:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:25,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 324 states and 612 transitions. [2018-11-10 07:51:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 612 transitions. [2018-11-10 07:51:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:26,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 322 states and 606 transitions. [2018-11-10 07:51:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 606 transitions. [2018-11-10 07:51:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:26,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 367 states and 699 transitions. [2018-11-10 07:51:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 699 transitions. [2018-11-10 07:51:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:27,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:27,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-11-10 07:51:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 365 states and 694 transitions. [2018-11-10 07:51:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 694 transitions. [2018-11-10 07:51:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:27,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 409 states and 785 transitions. [2018-11-10 07:51:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 785 transitions. [2018-11-10 07:51:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:28,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 408 states and 781 transitions. [2018-11-10 07:51:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 781 transitions. [2018-11-10 07:51:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:28,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 452 states and 873 transitions. [2018-11-10 07:51:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 873 transitions. [2018-11-10 07:51:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:30,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 451 states and 868 transitions. [2018-11-10 07:51:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 868 transitions. [2018-11-10 07:51:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:30,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:30,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-11-10 07:51:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 458 states and 886 transitions. [2018-11-10 07:51:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 886 transitions. [2018-11-10 07:51:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:51:35,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 458 states and 885 transitions. [2018-11-10 07:51:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 885 transitions. [2018-11-10 07:51:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:36,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 462 states and 891 transitions. [2018-11-10 07:51:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 891 transitions. [2018-11-10 07:51:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:36,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 466 states and 897 transitions. [2018-11-10 07:51:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 897 transitions. [2018-11-10 07:51:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:37,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 470 states and 904 transitions. [2018-11-10 07:51:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 904 transitions. [2018-11-10 07:51:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:39,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 472 states and 908 transitions. [2018-11-10 07:51:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 908 transitions. [2018-11-10 07:51:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:39,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 519 states and 1004 transitions. [2018-11-10 07:51:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1004 transitions. [2018-11-10 07:51:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:41,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 531 states and 1038 transitions. [2018-11-10 07:51:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1038 transitions. [2018-11-10 07:51:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:50,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 529 states and 1032 transitions. [2018-11-10 07:51:50,474 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1032 transitions. [2018-11-10 07:51:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:50,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 537 states and 1050 transitions. [2018-11-10 07:51:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1050 transitions. [2018-11-10 07:51:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:53,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 538 states and 1050 transitions. [2018-11-10 07:51:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1050 transitions. [2018-11-10 07:51:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:53,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 581 states and 1134 transitions. [2018-11-10 07:51:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1134 transitions. [2018-11-10 07:51:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:54,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 586 states and 1141 transitions. [2018-11-10 07:51:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1141 transitions. [2018-11-10 07:51:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:54,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 589 states and 1144 transitions. [2018-11-10 07:51:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1144 transitions. [2018-11-10 07:51:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:56,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 590 states and 1147 transitions. [2018-11-10 07:51:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1147 transitions. [2018-11-10 07:51:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:56,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 596 states and 1161 transitions. [2018-11-10 07:51:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1161 transitions. [2018-11-10 07:51:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:57,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 604 states and 1177 transitions. [2018-11-10 07:51:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1177 transitions. [2018-11-10 07:51:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:59,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:59,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-11-10 07:51:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 608 states and 1183 transitions. [2018-11-10 07:51:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1183 transitions. [2018-11-10 07:51:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:59,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:59,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-11-10 07:51:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 609 states and 1183 transitions. [2018-11-10 07:51:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1183 transitions. [2018-11-10 07:51:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:51:59,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 617 states and 1203 transitions. [2018-11-10 07:52:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1203 transitions. [2018-11-10 07:52:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:12,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 626 states and 1220 transitions. [2018-11-10 07:52:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1220 transitions. [2018-11-10 07:52:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:14,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 627 states and 1222 transitions. [2018-11-10 07:52:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1222 transitions. [2018-11-10 07:52:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:15,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 631 states and 1229 transitions. [2018-11-10 07:52:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1229 transitions. [2018-11-10 07:52:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:16,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 632 states and 1229 transitions. [2018-11-10 07:52:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1229 transitions. [2018-11-10 07:52:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:16,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 631 states and 1226 transitions. [2018-11-10 07:52:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1226 transitions. [2018-11-10 07:52:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:16,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 633 states and 1230 transitions. [2018-11-10 07:52:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1230 transitions. [2018-11-10 07:52:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:16,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:17,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-11-10 07:52:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 634 states and 1233 transitions. [2018-11-10 07:52:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1233 transitions. [2018-11-10 07:52:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:19,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 635 states and 1236 transitions. [2018-11-10 07:52:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1236 transitions. [2018-11-10 07:52:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:21,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 636 states and 1238 transitions. [2018-11-10 07:52:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1238 transitions. [2018-11-10 07:52:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:22,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 637 states and 1241 transitions. [2018-11-10 07:52:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1241 transitions. [2018-11-10 07:52:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:23,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 643 states and 1254 transitions. [2018-11-10 07:52:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1254 transitions. [2018-11-10 07:52:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 07:52:24,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 626 states and 1190 transitions. [2018-11-10 07:52:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1190 transitions. [2018-11-10 07:52:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 07:52:28,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 635 states and 1209 transitions. [2018-11-10 07:52:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1209 transitions. [2018-11-10 07:52:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 07:52:33,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 643 states and 1228 transitions. [2018-11-10 07:52:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1228 transitions. [2018-11-10 07:52:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:52:38,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:38,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-11-10 07:52:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 645 states and 1230 transitions. [2018-11-10 07:52:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1230 transitions. [2018-11-10 07:52:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:52:42,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 658 states and 1258 transitions. [2018-11-10 07:53:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1258 transitions. [2018-11-10 07:53:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:53:10,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 656 states and 1251 transitions. [2018-11-10 07:53:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1251 transitions. [2018-11-10 07:53:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:53:12,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 655 states and 1248 transitions. [2018-11-10 07:53:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1248 transitions. [2018-11-10 07:53:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 07:53:14,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 653 states and 1245 transitions. [2018-11-10 07:53:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1245 transitions. [2018-11-10 07:53:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:15,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 657 states and 1250 transitions. [2018-11-10 07:53:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1250 transitions. [2018-11-10 07:53:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:17,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 661 states and 1256 transitions. [2018-11-10 07:53:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1256 transitions. [2018-11-10 07:53:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:21,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:21,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-11-10 07:53:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 662 states and 1256 transitions. [2018-11-10 07:53:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1256 transitions. [2018-11-10 07:53:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:21,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 675 states and 1283 transitions. [2018-11-10 07:53:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1283 transitions. [2018-11-10 07:53:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:30,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 679 states and 1291 transitions. [2018-11-10 07:53:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1291 transitions. [2018-11-10 07:53:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:31,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 680 states and 1292 transitions. [2018-11-10 07:53:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1292 transitions. [2018-11-10 07:53:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:31,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 731 states and 1395 transitions. [2018-11-10 07:53:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1395 transitions. [2018-11-10 07:53:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:39,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 732 states and 1395 transitions. [2018-11-10 07:53:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1395 transitions. [2018-11-10 07:53:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:40,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 733 states and 1395 transitions. [2018-11-10 07:53:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1395 transitions. [2018-11-10 07:53:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:41,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 734 states and 1395 transitions. [2018-11-10 07:53:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1395 transitions. [2018-11-10 07:53:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:42,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 735 states and 1396 transitions. [2018-11-10 07:53:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1396 transitions. [2018-11-10 07:53:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:42,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 740 states and 1407 transitions. [2018-11-10 07:53:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1407 transitions. [2018-11-10 07:53:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:43,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 777 states and 1479 transitions. [2018-11-10 07:53:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1479 transitions. [2018-11-10 07:53:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:44,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 778 states and 1479 transitions. [2018-11-10 07:53:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1479 transitions. [2018-11-10 07:53:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:45,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 779 states and 1479 transitions. [2018-11-10 07:53:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1479 transitions. [2018-11-10 07:53:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:45,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 780 states and 1479 transitions. [2018-11-10 07:53:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1479 transitions. [2018-11-10 07:53:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:46,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 784 states and 1487 transitions. [2018-11-10 07:53:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1487 transitions. [2018-11-10 07:53:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:51,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 831 states and 1585 transitions. [2018-11-10 07:53:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1585 transitions. [2018-11-10 07:53:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:58,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 832 states and 1586 transitions. [2018-11-10 07:53:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1586 transitions. [2018-11-10 07:53:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:58,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 833 states and 1587 transitions. [2018-11-10 07:53:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1587 transitions. [2018-11-10 07:53:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:53:58,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 875 states and 1667 transitions. [2018-11-10 07:54:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1667 transitions. [2018-11-10 07:54:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:01,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 884 states and 1679 transitions. [2018-11-10 07:54:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1679 transitions. [2018-11-10 07:54:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:05,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 885 states and 1680 transitions. [2018-11-10 07:54:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1680 transitions. [2018-11-10 07:54:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:05,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:05,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-11-10 07:54:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 886 states and 1681 transitions. [2018-11-10 07:54:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1681 transitions. [2018-11-10 07:54:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:06,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:06,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-11-10 07:54:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 883 states and 1669 transitions. [2018-11-10 07:54:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1669 transitions. [2018-11-10 07:54:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:10,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:11,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-11-10 07:54:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 880 states and 1664 transitions. [2018-11-10 07:54:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2018-11-10 07:54:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:15,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 882 states and 1667 transitions. [2018-11-10 07:54:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1667 transitions. [2018-11-10 07:54:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:17,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 879 states and 1662 transitions. [2018-11-10 07:54:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1662 transitions. [2018-11-10 07:54:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:22,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 878 states and 1659 transitions. [2018-11-10 07:54:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1659 transitions. [2018-11-10 07:54:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:24,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:24,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-11-10 07:54:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 886 states and 1674 transitions. [2018-11-10 07:54:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1674 transitions. [2018-11-10 07:54:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:27,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 887 states and 1676 transitions. [2018-11-10 07:54:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1676 transitions. [2018-11-10 07:54:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:30,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 890 states and 1680 transitions. [2018-11-10 07:54:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1680 transitions. [2018-11-10 07:54:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:35,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 889 states and 1677 transitions. [2018-11-10 07:54:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1677 transitions. [2018-11-10 07:54:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:38,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 891 states and 1679 transitions. [2018-11-10 07:54:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1679 transitions. [2018-11-10 07:54:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:40,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 896 states and 1686 transitions. [2018-11-10 07:54:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1686 transitions. [2018-11-10 07:54:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:41,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 894 states and 1683 transitions. [2018-11-10 07:54:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1683 transitions. [2018-11-10 07:54:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:43,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 903 states and 1700 transitions. [2018-11-10 07:54:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1700 transitions. [2018-11-10 07:54:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:49,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 903 states and 1699 transitions. [2018-11-10 07:54:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1699 transitions. [2018-11-10 07:54:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:50,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 904 states and 1699 transitions. [2018-11-10 07:54:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1699 transitions. [2018-11-10 07:54:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:51,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:54:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:54:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 910 states and 1710 transitions. [2018-11-10 07:54:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1710 transitions. [2018-11-10 07:54:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:54:54,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:54:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:54:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 923 states and 1730 transitions. [2018-11-10 07:55:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1730 transitions. [2018-11-10 07:55:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:55:00,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 930 states and 1740 transitions. [2018-11-10 07:55:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1740 transitions. [2018-11-10 07:55:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:55:04,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:04,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-11-10 07:55:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 810 states and 1481 transitions. [2018-11-10 07:55:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1481 transitions. [2018-11-10 07:55:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:55:06,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 810 states and 1478 transitions. [2018-11-10 07:55:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1478 transitions. [2018-11-10 07:55:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:55:07,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:07,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-11-10 07:55:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 810 states and 1477 transitions. [2018-11-10 07:55:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1477 transitions. [2018-11-10 07:55:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 07:55:09,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 810 states and 1476 transitions. [2018-11-10 07:55:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1476 transitions. [2018-11-10 07:55:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:11,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 814 states and 1481 transitions. [2018-11-10 07:55:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1481 transitions. [2018-11-10 07:55:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:16,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 818 states and 1486 transitions. [2018-11-10 07:55:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1486 transitions. [2018-11-10 07:55:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:21,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 835 states and 1519 transitions. [2018-11-10 07:55:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1519 transitions. [2018-11-10 07:55:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:38,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 839 states and 1527 transitions. [2018-11-10 07:55:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1527 transitions. [2018-11-10 07:55:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:39,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:39,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-11-10 07:55:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 849 states and 1544 transitions. [2018-11-10 07:55:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1544 transitions. [2018-11-10 07:55:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:45,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 852 states and 1546 transitions. [2018-11-10 07:55:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1546 transitions. [2018-11-10 07:55:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:46,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 855 states and 1551 transitions. [2018-11-10 07:55:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1551 transitions. [2018-11-10 07:55:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:48,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 859 states and 1554 transitions. [2018-11-10 07:55:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1554 transitions. [2018-11-10 07:55:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:49,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:55:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:55:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 872 states and 1573 transitions. [2018-11-10 07:55:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1573 transitions. [2018-11-10 07:55:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:55:56,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:55:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 879 states and 1589 transitions. [2018-11-10 07:56:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1589 transitions. [2018-11-10 07:56:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:03,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 883 states and 1594 transitions. [2018-11-10 07:56:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1594 transitions. [2018-11-10 07:56:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:07,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 896 states and 1619 transitions. [2018-11-10 07:56:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1619 transitions. [2018-11-10 07:56:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:16,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:16,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-11-10 07:56:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 900 states and 1624 transitions. [2018-11-10 07:56:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1624 transitions. [2018-11-10 07:56:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:20,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 904 states and 1630 transitions. [2018-11-10 07:56:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1630 transitions. [2018-11-10 07:56:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:32,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 893 states and 1610 transitions. [2018-11-10 07:56:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1610 transitions. [2018-11-10 07:56:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:40,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 901 states and 1621 transitions. [2018-11-10 07:56:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1621 transitions. [2018-11-10 07:56:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:45,910 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:45,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-11-10 07:56:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 901 states and 1618 transitions. [2018-11-10 07:56:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1618 transitions. [2018-11-10 07:56:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 07:56:47,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:56:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 898 states and 1611 transitions. [2018-11-10 07:56:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1611 transitions. [2018-11-10 07:56:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 07:56:55,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:56:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:57:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 910 states and 1628 transitions. [2018-11-10 07:57:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1628 transitions. [2018-11-10 07:57:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:57:03,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:57:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:03,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-11-10 07:57:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:57:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 914 states and 1633 transitions. [2018-11-10 07:57:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1633 transitions. [2018-11-10 07:57:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:57:07,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:57:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:57:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 957 states and 1717 transitions. [2018-11-10 07:57:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1717 transitions. [2018-11-10 07:57:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:57:08,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:57:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:57:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 959 states and 1720 transitions. [2018-11-10 07:57:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1720 transitions. [2018-11-10 07:57:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:57:12,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:57:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:57:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 939 states and 1688 transitions. [2018-11-10 07:57:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1688 transitions. [2018-11-10 07:57:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:57:18,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:19,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-11-10 07:58:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 943 states and 1698 transitions. [2018-11-10 07:58:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1698 transitions. [2018-11-10 07:58:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:58:06,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 943 states and 1697 transitions. [2018-11-10 07:58:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1697 transitions. [2018-11-10 07:58:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:58:09,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 926 states and 1666 transitions. [2018-11-10 07:58:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1666 transitions. [2018-11-10 07:58:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:58:11,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:58:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 924 states and 1659 transitions. [2018-11-10 07:58:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1659 transitions. [2018-11-10 07:58:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:58:13,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:58:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:58:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 941 states and 1688 transitions. [2018-11-10 07:59:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1688 transitions. [2018-11-10 07:59:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:10,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 941 states and 1687 transitions. [2018-11-10 07:59:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1687 transitions. [2018-11-10 07:59:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:19,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 943 states and 1690 transitions. [2018-11-10 07:59:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1690 transitions. [2018-11-10 07:59:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:22,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 943 states and 1689 transitions. [2018-11-10 07:59:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1689 transitions. [2018-11-10 07:59:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:26,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 932 states and 1673 transitions. [2018-11-10 07:59:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1673 transitions. [2018-11-10 07:59:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:30,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 867 states and 1538 transitions. [2018-11-10 07:59:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1538 transitions. [2018-11-10 07:59:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:34,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 867 states and 1537 transitions. [2018-11-10 07:59:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1537 transitions. [2018-11-10 07:59:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:40,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 910 states and 1617 transitions. [2018-11-10 07:59:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1617 transitions. [2018-11-10 07:59:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:44,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 911 states and 1618 transitions. [2018-11-10 07:59:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1618 transitions. [2018-11-10 07:59:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:44,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 915 states and 1622 transitions. [2018-11-10 07:59:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1622 transitions. [2018-11-10 07:59:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:59:49,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:59:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 904 states and 1604 transitions. [2018-11-10 07:59:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1604 transitions. [2018-11-10 07:59:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 07:59:51,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:52,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-11-10 07:59:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:59:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 913 states and 1614 transitions. [2018-11-10 07:59:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1614 transitions. [2018-11-10 07:59:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 07:59:59,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:59:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:59:59,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-11-10 08:00:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:00:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 917 states and 1620 transitions. [2018-11-10 08:00:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1620 transitions. [2018-11-10 08:00:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 08:00:11,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:00:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 08:00:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 921 states and 1625 transitions. [2018-11-10 08:00:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1625 transitions. [2018-11-10 08:00:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 08:00:12,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 08:00:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:00:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:00:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:00:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:00:13,278 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 144 iterations. [2018-11-10 08:00:13,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 08:00:13 ImpRootNode [2018-11-10 08:00:13,440 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 08:00:13,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:00:13,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:00:13,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:00:13,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:17" (3/4) ... [2018-11-10 08:00:13,443 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:00:13,602 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d680cb7-7adf-44d6-a685-3f9423aa0049/bin-2019/ukojak/witness.graphml [2018-11-10 08:00:13,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:00:13,603 INFO L168 Benchmark]: Toolchain (without parser) took 537937.50 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 670.6 MB). Free memory was 957.5 MB in the beginning and 515.8 MB in the end (delta: 441.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,604 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:00:13,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 925.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,604 INFO L168 Benchmark]: Boogie Preprocessor took 34.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,604 INFO L168 Benchmark]: RCFGBuilder took 1492.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.2 MB in the end (delta: 295.5 MB). Peak memory consumption was 295.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,605 INFO L168 Benchmark]: CodeCheck took 535705.18 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.6 MB). Free memory was 823.2 MB in the beginning and 565.0 MB in the end (delta: 258.2 MB). Peak memory consumption was 789.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,605 INFO L168 Benchmark]: Witness Printer took 161.24 ms. Allocated memory is still 1.7 GB. Free memory was 565.0 MB in the beginning and 515.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:13,606 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, 535.5s OverallTime, 144 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1550345624 SDtfs, 917513308 SDslu, -2014071652 SDs, 0 SdLazy, 340076532 SolverSat, 705204576 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 185.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140360 GetRequests, 137062 SyntacticMatches, 1486 SemanticMatches, 1812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719663 ImplicationChecksByTransitivity, 524.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 17724 NumberOfCodeBlocks, 17724 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 17452 ConstructedInterpolants, 0 QuantifiedInterpolants, 7319157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 143 InterpolantComputations, 143 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p13_old=-1, p21=0, p21_new=95, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=-128, m2=94, m3=-128, max1=93, max2=95, max3=94, 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=93, p21=0, p21_new=-1, p21_old=95, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=95, m2=94, m3=-128, max1=95, max2=95, max3=94, 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=93, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=95, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=94, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=93, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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=93, id2=95, id3=94, m1=-1, m2=-1, m3=-1, max1=95, max2=95, max3=94, 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.29 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 925.3 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 84.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1492.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.2 MB in the end (delta: 295.5 MB). Peak memory consumption was 295.5 MB. Max. memory is 11.5 GB. * CodeCheck took 535705.18 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.6 MB). Free memory was 823.2 MB in the beginning and 565.0 MB in the end (delta: 258.2 MB). Peak memory consumption was 789.8 MB. Max. memory is 11.5 GB. * Witness Printer took 161.24 ms. Allocated memory is still 1.7 GB. Free memory was 565.0 MB in the beginning and 515.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...