./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_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_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/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 248783628c8bc0768599d1adf3a6d84dd210baa8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:52:45,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:52:45,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:52:45,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:52:45,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:52:45,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:52:45,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:52:45,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:52:45,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:52:45,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:52:45,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:52:45,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:52:45,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:52:45,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:52:45,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:52:45,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:52:45,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:52:45,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:52:45,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:52:45,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:52:45,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:52:45,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:52:45,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:52:45,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:52:45,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:52:45,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:52:45,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:52:45,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:52:45,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:52:45,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:52:45,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:52:45,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:52:45,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:52:45,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:52:45,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:52:45,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:52:45,805 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 19:52:45,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:52:45,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:52:45,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:52:45,817 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:52:45,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:52:45,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:52:45,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:52:45,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:52:45,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:52:45,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:52:45,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:52:45,820 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 19:52:45,821 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 19:52:45,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:52:45,822 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:52:45,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:52:45,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:52:45,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:52:45,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:52:45,822 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 19:52:45,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:52:45,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:52:45,823 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_63bcd232-d728-4d6d-8846-89eb9f3373ea/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 -> 248783628c8bc0768599d1adf3a6d84dd210baa8 [2018-10-26 19:52:45,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:52:45,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:52:45,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:52:45,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:52:45,867 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:52:45,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-10-26 19:52:45,912 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/data/b71b25677/959e630c740943cda9df4b979adf5e19/FLAGd27cf383a [2018-10-26 19:52:46,369 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:52:46,372 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-10-26 19:52:46,382 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/data/b71b25677/959e630c740943cda9df4b979adf5e19/FLAGd27cf383a [2018-10-26 19:52:46,392 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/data/b71b25677/959e630c740943cda9df4b979adf5e19 [2018-10-26 19:52:46,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:52:46,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:52:46,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:52:46,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:52:46,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:52:46,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:52:46" (1/1) ... [2018-10-26 19:52:46,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@994f705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:46, skipping insertion in model container [2018-10-26 19:52:46,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:52:46" (1/1) ... [2018-10-26 19:52:46,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:52:46,466 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:52:46,824 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:52:46,833 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:52:47,059 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:52:47,075 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:52:47,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47 WrapperNode [2018-10-26 19:52:47,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:52:47,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:52:47,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:52:47,077 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:52:47,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:52:47,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:52:47,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:52:47,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:52:47,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... [2018-10-26 19:52:47,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:52:47,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:52:47,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:52:47,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:52:47,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:52:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:52:47,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:52:47,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:52:51,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:52:51,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:52:51 BoogieIcfgContainer [2018-10-26 19:52:51,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:52:51,687 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 19:52:51,688 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 19:52:51,697 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 19:52:51,698 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:52:51" (1/1) ... [2018-10-26 19:52:51,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 216 states and 380 transitions. [2018-10-26 19:52:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 380 transitions. [2018-10-26 19:52:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 19:52:51,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:52,654 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-26 19:52:52,792 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-26 19:52:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:53,230 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 19:52:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 226 states and 398 transitions. [2018-10-26 19:52:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 398 transitions. [2018-10-26 19:52:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:53,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 227 states and 399 transitions. [2018-10-26 19:52:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 399 transitions. [2018-10-26 19:52:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:53,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 271 states and 486 transitions. [2018-10-26 19:52:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 486 transitions. [2018-10-26 19:52:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:54,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 271 states and 485 transitions. [2018-10-26 19:52:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 485 transitions. [2018-10-26 19:52:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:56,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 270 states and 482 transitions. [2018-10-26 19:52:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 482 transitions. [2018-10-26 19:52:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:56,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 314 states and 569 transitions. [2018-10-26 19:52:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 569 transitions. [2018-10-26 19:52:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:57,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 313 states and 566 transitions. [2018-10-26 19:52:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 566 transitions. [2018-10-26 19:52:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:57,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 358 states and 654 transitions. [2018-10-26 19:52:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 654 transitions. [2018-10-26 19:52:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:59,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 356 states and 648 transitions. [2018-10-26 19:52:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 648 transitions. [2018-10-26 19:52:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:59,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 358 states and 653 transitions. [2018-10-26 19:52:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 653 transitions. [2018-10-26 19:52:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 19:52:59,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:59,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-10-26 19:52:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:52:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 361 states and 658 transitions. [2018-10-26 19:52:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 658 transitions. [2018-10-26 19:52:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 19:52:59,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:52:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 357 states and 650 transitions. [2018-10-26 19:53:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 650 transitions. [2018-10-26 19:53:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 19:53:00,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 360 states and 655 transitions. [2018-10-26 19:53:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 655 transitions. [2018-10-26 19:53:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:02,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 360 states and 654 transitions. [2018-10-26 19:53:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 654 transitions. [2018-10-26 19:53:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:02,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:04,700 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 19:53:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 412 states and 760 transitions. [2018-10-26 19:53:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 760 transitions. [2018-10-26 19:53:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:06,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 411 states and 757 transitions. [2018-10-26 19:53:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 757 transitions. [2018-10-26 19:53:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:07,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:07,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-10-26 19:53:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 420 states and 776 transitions. [2018-10-26 19:53:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 776 transitions. [2018-10-26 19:53:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:11,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 426 states and 790 transitions. [2018-10-26 19:53:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 790 transitions. [2018-10-26 19:53:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:17,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 482 states and 906 transitions. [2018-10-26 19:53:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 906 transitions. [2018-10-26 19:53:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:24,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 490 states and 919 transitions. [2018-10-26 19:53:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 919 transitions. [2018-10-26 19:53:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:26,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 491 states and 920 transitions. [2018-10-26 19:53:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 920 transitions. [2018-10-26 19:53:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:27,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 493 states and 928 transitions. [2018-10-26 19:53:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 928 transitions. [2018-10-26 19:53:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:28,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 496 states and 935 transitions. [2018-10-26 19:53:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 935 transitions. [2018-10-26 19:53:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:29,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 544 states and 1031 transitions. [2018-10-26 19:53:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1031 transitions. [2018-10-26 19:53:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 19:53:32,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 547 states and 1036 transitions. [2018-10-26 19:53:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1036 transitions. [2018-10-26 19:53:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:53:34,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 545 states and 1029 transitions. [2018-10-26 19:53:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1029 transitions. [2018-10-26 19:53:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:53:35,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 552 states and 1044 transitions. [2018-10-26 19:53:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1044 transitions. [2018-10-26 19:53:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:53:38,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 538 states and 1020 transitions. [2018-10-26 19:53:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1020 transitions. [2018-10-26 19:53:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:53:39,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 546 states and 1037 transitions. [2018-10-26 19:53:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1037 transitions. [2018-10-26 19:53:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:53:42,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 553 states and 1050 transitions. [2018-10-26 19:53:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1050 transitions. [2018-10-26 19:53:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:53:47,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 554 states and 1054 transitions. [2018-10-26 19:53:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1054 transitions. [2018-10-26 19:53:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:53:48,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 553 states and 1050 transitions. [2018-10-26 19:53:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1050 transitions. [2018-10-26 19:53:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:53:51,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:53:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:53:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 561 states and 1064 transitions. [2018-10-26 19:53:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1064 transitions. [2018-10-26 19:53:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:53:52,769 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:53:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:53:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 588 states and 1122 transitions. [2018-10-26 19:54:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1122 transitions. [2018-10-26 19:54:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:09,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 629 states and 1203 transitions. [2018-10-26 19:54:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1203 transitions. [2018-10-26 19:54:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:12,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 629 states and 1198 transitions. [2018-10-26 19:54:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1198 transitions. [2018-10-26 19:54:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:13,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 674 states and 1285 transitions. [2018-10-26 19:54:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1285 transitions. [2018-10-26 19:54:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:15,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 682 states and 1298 transitions. [2018-10-26 19:54:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1298 transitions. [2018-10-26 19:54:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:18,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 685 states and 1303 transitions. [2018-10-26 19:54:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1303 transitions. [2018-10-26 19:54:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:18,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 690 states and 1314 transitions. [2018-10-26 19:54:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1314 transitions. [2018-10-26 19:54:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:20,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 730 states and 1390 transitions. [2018-10-26 19:54:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1390 transitions. [2018-10-26 19:54:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:24,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 734 states and 1399 transitions. [2018-10-26 19:54:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1399 transitions. [2018-10-26 19:54:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:28,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 735 states and 1399 transitions. [2018-10-26 19:54:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1399 transitions. [2018-10-26 19:54:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:29,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 737 states and 1403 transitions. [2018-10-26 19:54:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1403 transitions. [2018-10-26 19:54:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:30,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 740 states and 1414 transitions. [2018-10-26 19:54:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1414 transitions. [2018-10-26 19:54:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:34,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 740 states and 1413 transitions. [2018-10-26 19:54:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1413 transitions. [2018-10-26 19:54:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:35,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 758 states and 1449 transitions. [2018-10-26 19:54:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1449 transitions. [2018-10-26 19:54:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:38,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 762 states and 1456 transitions. [2018-10-26 19:54:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1456 transitions. [2018-10-26 19:54:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:39,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 763 states and 1456 transitions. [2018-10-26 19:54:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1456 transitions. [2018-10-26 19:54:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:39,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 764 states and 1458 transitions. [2018-10-26 19:54:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1458 transitions. [2018-10-26 19:54:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:40,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 765 states and 1458 transitions. [2018-10-26 19:54:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1458 transitions. [2018-10-26 19:54:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:41,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 765 states and 1457 transitions. [2018-10-26 19:54:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1457 transitions. [2018-10-26 19:54:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:43,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 787 states and 1500 transitions. [2018-10-26 19:54:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1500 transitions. [2018-10-26 19:54:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:46,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 811 states and 1545 transitions. [2018-10-26 19:54:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1545 transitions. [2018-10-26 19:54:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:51,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 833 states and 1585 transitions. [2018-10-26 19:54:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1585 transitions. [2018-10-26 19:54:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:52,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 834 states and 1587 transitions. [2018-10-26 19:54:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1587 transitions. [2018-10-26 19:54:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:53,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 835 states and 1589 transitions. [2018-10-26 19:54:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1589 transitions. [2018-10-26 19:54:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:54,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:54:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 857 states and 1631 transitions. [2018-10-26 19:54:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1631 transitions. [2018-10-26 19:54:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:54:57,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:54:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 903 states and 1720 transitions. [2018-10-26 19:55:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1720 transitions. [2018-10-26 19:55:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:04,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 921 states and 1754 transitions. [2018-10-26 19:55:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1754 transitions. [2018-10-26 19:55:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:06,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 924 states and 1758 transitions. [2018-10-26 19:55:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1758 transitions. [2018-10-26 19:55:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:06,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 926 states and 1759 transitions. [2018-10-26 19:55:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1759 transitions. [2018-10-26 19:55:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:06,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 929 states and 1764 transitions. [2018-10-26 19:55:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1764 transitions. [2018-10-26 19:55:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:07,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 932 states and 1771 transitions. [2018-10-26 19:55:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1771 transitions. [2018-10-26 19:55:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:08,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 933 states and 1771 transitions. [2018-10-26 19:55:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1771 transitions. [2018-10-26 19:55:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:08,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:08,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-10-26 19:55:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 934 states and 1771 transitions. [2018-10-26 19:55:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1771 transitions. [2018-10-26 19:55:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:08,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 937 states and 1781 transitions. [2018-10-26 19:55:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1781 transitions. [2018-10-26 19:55:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:31,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 950 states and 1800 transitions. [2018-10-26 19:55:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1800 transitions. [2018-10-26 19:55:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:33,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:33,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-10-26 19:55:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 952 states and 1804 transitions. [2018-10-26 19:55:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1804 transitions. [2018-10-26 19:55:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:37,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 957 states and 1811 transitions. [2018-10-26 19:55:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1811 transitions. [2018-10-26 19:55:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:38,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:38,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-10-26 19:55:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 958 states and 1811 transitions. [2018-10-26 19:55:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1811 transitions. [2018-10-26 19:55:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:39,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:55:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 963 states and 1821 transitions. [2018-10-26 19:55:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1821 transitions. [2018-10-26 19:55:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:55:42,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:55:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 969 states and 1830 transitions. [2018-10-26 19:56:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1830 transitions. [2018-10-26 19:56:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:07,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:07,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-10-26 19:56:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 975 states and 1844 transitions. [2018-10-26 19:56:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1844 transitions. [2018-10-26 19:56:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:16,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 981 states and 1864 transitions. [2018-10-26 19:56:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1864 transitions. [2018-10-26 19:56:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:24,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 988 states and 1880 transitions. [2018-10-26 19:56:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1880 transitions. [2018-10-26 19:56:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:34,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 990 states and 1888 transitions. [2018-10-26 19:56:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1888 transitions. [2018-10-26 19:56:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:37,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 991 states and 1889 transitions. [2018-10-26 19:56:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1889 transitions. [2018-10-26 19:56:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:40,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 992 states and 1889 transitions. [2018-10-26 19:56:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1889 transitions. [2018-10-26 19:56:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:42,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 992 states and 1888 transitions. [2018-10-26 19:56:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1888 transitions. [2018-10-26 19:56:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:43,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 994 states and 1893 transitions. [2018-10-26 19:56:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1893 transitions. [2018-10-26 19:56:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:49,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 996 states and 1898 transitions. [2018-10-26 19:56:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1898 transitions. [2018-10-26 19:56:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:54,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1000 states and 1905 transitions. [2018-10-26 19:56:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1905 transitions. [2018-10-26 19:56:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:55,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:55,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-10-26 19:56:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:56:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1006 states and 1914 transitions. [2018-10-26 19:56:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1914 transitions. [2018-10-26 19:56:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:56:58,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:56:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1011 states and 1922 transitions. [2018-10-26 19:57:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1922 transitions. [2018-10-26 19:57:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:57:01,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1017 states and 1930 transitions. [2018-10-26 19:57:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1930 transitions. [2018-10-26 19:57:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:04,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:08,309 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-26 19:57:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1015 states and 1927 transitions. [2018-10-26 19:57:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1927 transitions. [2018-10-26 19:57:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:12,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1016 states and 1929 transitions. [2018-10-26 19:57:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1929 transitions. [2018-10-26 19:57:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:14,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1018 states and 1934 transitions. [2018-10-26 19:57:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1934 transitions. [2018-10-26 19:57:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:20,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1019 states and 1936 transitions. [2018-10-26 19:57:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1936 transitions. [2018-10-26 19:57:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:22,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 995 states and 1878 transitions. [2018-10-26 19:57:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1878 transitions. [2018-10-26 19:57:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:23,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:57:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 996 states and 1879 transitions. [2018-10-26 19:57:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1879 transitions. [2018-10-26 19:57:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:57:23,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:57:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:58:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1011 states and 1911 transitions. [2018-10-26 19:58:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1911 transitions. [2018-10-26 19:58:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:58:06,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:58:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:58:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1022 states and 1936 transitions. [2018-10-26 19:58:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1936 transitions. [2018-10-26 19:58:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:58:19,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:58:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:58:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1033 states and 1952 transitions. [2018-10-26 19:58:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1952 transitions. [2018-10-26 19:58:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:58:37,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:58:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:58:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1040 states and 1960 transitions. [2018-10-26 19:58:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1960 transitions. [2018-10-26 19:58:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:58:42,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:58:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:59:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 1075 states and 2032 transitions. [2018-10-26 19:59:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2032 transitions. [2018-10-26 19:59:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:59:42,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:59:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:59:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 1076 states and 2032 transitions. [2018-10-26 19:59:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2032 transitions. [2018-10-26 19:59:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:59:44,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:59:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:59:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1062 states and 1998 transitions. [2018-10-26 19:59:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1998 transitions. [2018-10-26 19:59:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:59:49,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:59:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:59:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 1063 states and 2000 transitions. [2018-10-26 19:59:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 2000 transitions. [2018-10-26 19:59:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 19:59:51,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:59:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1059 states and 1991 transitions. [2018-10-26 20:00:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1991 transitions. [2018-10-26 20:00:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:00,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 1062 states and 2001 transitions. [2018-10-26 20:00:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 2001 transitions. [2018-10-26 20:00:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:04,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1069 states and 2012 transitions. [2018-10-26 20:00:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2012 transitions. [2018-10-26 20:00:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:10,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1071 states and 2016 transitions. [2018-10-26 20:00:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2016 transitions. [2018-10-26 20:00:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:12,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:13,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-10-26 20:00:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1075 states and 2024 transitions. [2018-10-26 20:00:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2024 transitions. [2018-10-26 20:00:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:16,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1121 states and 2115 transitions. [2018-10-26 20:00:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2115 transitions. [2018-10-26 20:00:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:25,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:00:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1121 states and 2113 transitions. [2018-10-26 20:00:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2113 transitions. [2018-10-26 20:00:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:00:33,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:00:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1178 states and 2225 transitions. [2018-10-26 20:01:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2225 transitions. [2018-10-26 20:01:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:04,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1178 states and 2224 transitions. [2018-10-26 20:01:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2224 transitions. [2018-10-26 20:01:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:11,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1196 states and 2258 transitions. [2018-10-26 20:01:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2258 transitions. [2018-10-26 20:01:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:16,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 1168 states and 2201 transitions. [2018-10-26 20:01:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2201 transitions. [2018-10-26 20:01:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:22,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1180 states and 2218 transitions. [2018-10-26 20:01:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2218 transitions. [2018-10-26 20:01:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:28,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1031 states and 1930 transitions. [2018-10-26 20:01:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1930 transitions. [2018-10-26 20:01:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:31,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1034 states and 1934 transitions. [2018-10-26 20:01:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1934 transitions. [2018-10-26 20:01:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:32,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1034 states and 1933 transitions. [2018-10-26 20:01:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1933 transitions. [2018-10-26 20:01:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:34,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:01:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1064 states and 1990 transitions. [2018-10-26 20:01:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1990 transitions. [2018-10-26 20:01:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:01:47,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:01:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:02:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 1102 states and 2055 transitions. [2018-10-26 20:02:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2055 transitions. [2018-10-26 20:02:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:02:01,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:02:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:02:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1106 states and 2060 transitions. [2018-10-26 20:02:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2060 transitions. [2018-10-26 20:02:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:02:10,912 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:02:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:02:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1120 states and 2081 transitions. [2018-10-26 20:02:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2081 transitions. [2018-10-26 20:02:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:02:26,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:02:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:02:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1122 states and 2087 transitions. [2018-10-26 20:02:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2087 transitions. [2018-10-26 20:02:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:02:34,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:02:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:02:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1140 states and 2115 transitions. [2018-10-26 20:02:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 2115 transitions. [2018-10-26 20:02:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:02:57,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:02:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1124 states and 2082 transitions. [2018-10-26 20:03:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2082 transitions. [2018-10-26 20:03:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:05,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1131 states and 2092 transitions. [2018-10-26 20:03:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 2092 transitions. [2018-10-26 20:03:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:11,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1131 states and 2091 transitions. [2018-10-26 20:03:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 2091 transitions. [2018-10-26 20:03:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:17,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:17,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-10-26 20:03:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1127 states and 2079 transitions. [2018-10-26 20:03:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2079 transitions. [2018-10-26 20:03:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:25,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1125 states and 2076 transitions. [2018-10-26 20:03:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2076 transitions. [2018-10-26 20:03:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:27,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:27,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-10-26 20:03:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1098 states and 2030 transitions. [2018-10-26 20:03:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2030 transitions. [2018-10-26 20:03:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:33,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 949 states and 1734 transitions. [2018-10-26 20:03:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1734 transitions. [2018-10-26 20:03:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:03:38,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:03:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 946 states and 1730 transitions. [2018-10-26 20:03:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1730 transitions. [2018-10-26 20:03:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:03:40,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:03:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 994 states and 1824 transitions. [2018-10-26 20:04:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1824 transitions. [2018-10-26 20:04:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:00,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:00,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-10-26 20:04:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1002 states and 1837 transitions. [2018-10-26 20:04:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1837 transitions. [2018-10-26 20:04:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:18,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1030 states and 1891 transitions. [2018-10-26 20:04:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1891 transitions. [2018-10-26 20:04:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:30,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1036 states and 1898 transitions. [2018-10-26 20:04:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1898 transitions. [2018-10-26 20:04:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:33,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1076 states and 1973 transitions. [2018-10-26 20:04:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1973 transitions. [2018-10-26 20:04:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:43,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:04:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1076 states and 1971 transitions. [2018-10-26 20:04:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1971 transitions. [2018-10-26 20:04:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:04:45,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:04:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1118 states and 2042 transitions. [2018-10-26 20:05:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2042 transitions. [2018-10-26 20:05:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:02,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1166 states and 2132 transitions. [2018-10-26 20:05:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2132 transitions. [2018-10-26 20:05:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:27,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1184 states and 2166 transitions. [2018-10-26 20:05:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2166 transitions. [2018-10-26 20:05:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:32,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:32,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-10-26 20:05:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 1184 states and 2165 transitions. [2018-10-26 20:05:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2165 transitions. [2018-10-26 20:05:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:39,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1185 states and 2166 transitions. [2018-10-26 20:05:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2166 transitions. [2018-10-26 20:05:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:41,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 1229 states and 2253 transitions. [2018-10-26 20:05:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2253 transitions. [2018-10-26 20:05:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:54,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:05:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1231 states and 2254 transitions. [2018-10-26 20:05:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2254 transitions. [2018-10-26 20:05:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:05:59,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:05:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:05:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:06:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:06:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:06:00,247 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 143 iterations. [2018-10-26 20:06:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 08:06:00 ImpRootNode [2018-10-26 20:06:00,589 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 20:06:00,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:06:00,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:06:00,589 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:06:00,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:52:51" (3/4) ... [2018-10-26 20:06:00,595 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:06:00,838 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63bcd232-d728-4d6d-8846-89eb9f3373ea/bin-2019/ukojak/witness.graphml [2018-10-26 20:06:00,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:06:00,839 INFO L168 Benchmark]: Toolchain (without parser) took 794442.45 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 952.1 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,839 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:00,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.46 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,842 INFO L168 Benchmark]: Boogie Preprocessor took 52.97 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,842 INFO L168 Benchmark]: RCFGBuilder took 4409.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.8 MB in the end (delta: 246.5 MB). Peak memory consumption was 246.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,843 INFO L168 Benchmark]: CodeCheck took 788901.28 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 884.8 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,843 INFO L168 Benchmark]: Witness Printer took 248.97 ms. Allocated memory is still 4.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:00,845 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, 301 locations, 1 error locations. UNSAFE Result, 788.5s OverallTime, 143 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1218001264 SDtfs, 279425368 SDslu, 757698612 SDs, 0 SdLazy, -637591416 SolverSat, -70633972 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 372.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138203 GetRequests, 134587 SyntacticMatches, 1686 SemanticMatches, 1930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060622 ImplicationChecksByTransitivity, 769.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 17418 NumberOfCodeBlocks, 17418 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 17149 ConstructedInterpolants, 0 QuantifiedInterpolants, 8886476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 142 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: 823]: 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] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L65] int __return_1719; [L66] int __return_1847; [L67] int __return_1965; [L68] int __return_2067; [L69] int __return_2190; [L70] int __return_2300; [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; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; [L73] int main__c1; [L74] int main__i2; [L75] main__c1 = 0 [L76] ep12 = __VERIFIER_nondet_bool() [L77] ep13 = __VERIFIER_nondet_bool() [L78] ep21 = __VERIFIER_nondet_bool() [L79] ep23 = __VERIFIER_nondet_bool() [L80] ep31 = __VERIFIER_nondet_bool() [L81] ep32 = __VERIFIER_nondet_bool() [L82] id1 = __VERIFIER_nondet_char() [L83] r1 = __VERIFIER_nondet_uchar() [L84] st1 = __VERIFIER_nondet_char() [L85] nl1 = __VERIFIER_nondet_char() [L86] m1 = __VERIFIER_nondet_char() [L87] max1 = __VERIFIER_nondet_char() [L88] mode1 = __VERIFIER_nondet_bool() [L89] id2 = __VERIFIER_nondet_char() [L90] r2 = __VERIFIER_nondet_uchar() [L91] st2 = __VERIFIER_nondet_char() [L92] nl2 = __VERIFIER_nondet_char() [L93] m2 = __VERIFIER_nondet_char() [L94] max2 = __VERIFIER_nondet_char() [L95] mode2 = __VERIFIER_nondet_bool() [L96] id3 = __VERIFIER_nondet_char() [L97] r3 = __VERIFIER_nondet_uchar() [L98] st3 = __VERIFIER_nondet_char() [L99] nl3 = __VERIFIER_nondet_char() [L100] m3 = __VERIFIER_nondet_char() [L101] max3 = __VERIFIER_nondet_char() [L102] mode3 = __VERIFIER_nondet_bool() [L104] _Bool init__r121; [L105] _Bool init__r131; [L106] _Bool init__r211; [L107] _Bool init__r231; [L108] _Bool init__r311; [L109] _Bool init__r321; [L110] _Bool init__r122; [L111] int init__tmp; [L112] _Bool init__r132; [L113] int init__tmp___0; [L114] _Bool init__r212; [L115] int init__tmp___1; [L116] _Bool init__r232; [L117] int init__tmp___2; [L118] _Bool init__r312; [L119] int init__tmp___3; [L120] _Bool init__r322; [L121] int init__tmp___4; [L122] int init__tmp___5; [L123] init__r121 = ep12 [L124] init__r131 = ep13 [L125] init__r211 = ep21 [L126] init__r231 = ep23 [L127] init__r311 = ep31 [L128] init__r321 = ep32 [L129] COND TRUE !(init__r121 == 0) [L131] init__tmp = 1 [L133] init__r122 = (_Bool)init__tmp [L134] COND FALSE !(!(init__r131 == 0)) [L2204] COND TRUE !(init__r121 == 0) [L2206] COND TRUE !(ep23 == 0) [L2208] init__tmp___0 = 1 [L138] init__r132 = (_Bool)init__tmp___0 [L139] COND FALSE !(!(init__r211 == 0)) [L2181] COND TRUE !(init__r231 == 0) [L2183] COND TRUE !(ep31 == 0) [L2185] init__tmp___1 = 1 [L143] init__r212 = (_Bool)init__tmp___1 [L144] COND TRUE !(init__r231 == 0) [L146] init__tmp___2 = 1 [L148] init__r232 = (_Bool)init__tmp___2 [L149] COND TRUE !(init__r311 == 0) [L151] init__tmp___3 = 1 [L153] init__r312 = (_Bool)init__tmp___3 [L154] COND FALSE !(!(init__r321 == 0)) [L2112] COND TRUE !(init__r311 == 0) [L2114] COND TRUE !(ep12 == 0) [L2116] init__tmp___4 = 1 [L158] init__r322 = (_Bool)init__tmp___4 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L159] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L161] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L163] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)id2) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)id3) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)r1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L173] COND TRUE ((int)r2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L175] COND TRUE ((int)r3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L177] COND TRUE !(init__r122 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L179] COND TRUE !(init__r132 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L181] COND TRUE !(init__r212 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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__r232 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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__r312 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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__r322 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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 ((int)max1) == ((int)id1) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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 ((int)max2) == ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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 ((int)max3) == ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)st1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)st2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)st3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)nl1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)nl2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)nl3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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)mode1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L209] COND TRUE ((int)mode2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L211] COND TRUE ((int)mode3) == 0 [L213] init__tmp___5 = 1 [L214] __return_1719 = init__tmp___5 [L215] main__i2 = __return_1719 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, 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] [L216] COND TRUE main__i2 != 0 [L218] p12_old = nomsg [L219] p12_new = nomsg [L220] p13_old = nomsg [L221] p13_new = nomsg [L222] p21_old = nomsg [L223] p21_new = nomsg [L224] p23_old = nomsg [L225] p23_new = nomsg [L226] p31_old = nomsg [L227] p31_new = nomsg [L228] p32_old = nomsg [L229] p32_new = nomsg [L230] main__i2 = 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L238] COND TRUE ((int)r1) < 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L240] COND TRUE !(ep12 == 0) [L242] int node1____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE max1 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND TRUE p12_new == nomsg [L247] node1____CPAchecker_TMP_0 = max1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L249] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L251] COND FALSE !(!(ep13 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L262] mode1 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L264] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L270] COND TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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 FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L283] COND TRUE !(ep23 == 0) [L285] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L286] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L288] COND TRUE p23_new == nomsg [L290] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, 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] [L292] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] mode2 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L296] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L302] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L304] COND TRUE !(ep31 == 0) [L306] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L307] COND TRUE max3 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L309] COND TRUE p31_new == nomsg [L311] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, 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] [L313] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, p23_old=-1, p31=0, p31_new=24, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L315] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=22, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=23, p23_old=-1, p31=0, p31_new=24, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L326] mode3 = 1 [L327] p12_old = p12_new [L328] p12_new = nomsg [L329] p13_old = p13_new [L330] p13_new = nomsg [L331] p21_old = p21_new [L332] p21_new = nomsg [L333] p23_old = p23_new [L334] p23_new = nomsg [L335] p31_old = p31_new [L336] p31_new = nomsg [L337] p32_old = p32_new [L338] p32_new = nomsg [L340] int check__tmp; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L349] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L367] COND TRUE ((int)r1) < 2 [L369] check__tmp = 1 [L370] __return_1847 = check__tmp [L371] main__c1 = __return_1847 [L373] _Bool __tmp_1; [L374] __tmp_1 = main__c1 [L375] _Bool assert__arg; [L376] assert__arg = __tmp_1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=0, m2=23, m3=-128, max1=22, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND FALSE !(r1 == 255) [L392] r1 = r1 + 1 [L393] COND FALSE !(!(ep21 == 0)) [L401] COND TRUE !(ep31 == 0) [L403] m1 = p31_old [L404] p31_old = nomsg [L405] COND TRUE ((int)m1) > ((int)max1) [L407] max1 = m1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=23, m3=-128, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND FALSE !(((int)r1) == 2) [L415] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=23, m3=-128, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=23, m3=-128, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=22, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=23, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND FALSE !(r2 == 255) [L425] r2 = r2 + 1 [L426] COND TRUE !(ep12 == 0) [L428] m2 = p12_old [L429] p12_old = nomsg [L430] COND FALSE !(((int)m2) > ((int)max2)) [L434] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=-128, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=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=23, 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] [L442] COND FALSE !(((int)r2) == 2) [L448] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=-128, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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=23, 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] [L450] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=-128, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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=23, 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] [L452] COND FALSE !(r3 == 255) [L458] r3 = r3 + 1 [L459] COND FALSE !(!(ep13 == 0)) [L467] COND TRUE !(ep23 == 0) [L469] m3 = p23_old [L470] p23_old = nomsg [L471] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND FALSE !(((int)r3) == 2) [L481] mode3 = 0 [L482] p12_old = p12_new [L483] p12_new = nomsg [L484] p13_old = p13_new [L485] p13_new = nomsg [L486] p21_old = p21_new [L487] p21_new = nomsg [L488] p23_old = p23_new [L489] p23_new = nomsg [L490] p31_old = p31_new [L491] p31_new = nomsg [L492] p32_old = p32_new [L493] p32_new = nomsg [L495] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L496] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L498] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L500] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L502] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L504] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L510] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L512] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L514] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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 TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L522] COND TRUE ((int)r1) < 2 [L524] check__tmp = 1 [L525] __return_1965 = check__tmp [L526] main__c1 = __return_1965 [L528] _Bool __tmp_2; [L529] __tmp_2 = main__c1 [L530] _Bool assert__arg; [L531] assert__arg = __tmp_2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L532] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L539] COND FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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 FALSE !(((int)r1) < 1) [L551] mode1 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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] [L553] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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 TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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] [L561] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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] [L572] COND TRUE !(ep23 == 0) [L574] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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] [L575] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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 TRUE p23_new == nomsg [L579] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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] [L581] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=0, mode3=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=23, 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] [L583] mode2 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L585] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L591] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L593] COND TRUE !(ep31 == 0) [L595] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L596] COND TRUE max3 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L598] COND TRUE p31_new == nomsg [L600] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p23_old=-1, p31=0, p31_new=24, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L604] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p23_old=-1, p31=0, p31_new=24, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L615] mode3 = 1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L629] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L632] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L634] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L636] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L638] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L644] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L646] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L648] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L654] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L656] COND TRUE ((int)r1) < 2 [L658] check__tmp = 1 [L659] __return_2067 = check__tmp [L660] main__c1 = __return_2067 [L662] _Bool __tmp_3; [L663] __tmp_3 = main__c1 [L664] _Bool assert__arg; [L665] assert__arg = __tmp_3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L666] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L673] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, p31=0, p31_new=-1, p31_old=24, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L675] COND FALSE !(r1 == 255) [L681] r1 = r1 + 1 [L682] COND FALSE !(!(ep21 == 0)) [L690] COND TRUE !(ep31 == 0) [L692] m1 = p31_old [L693] p31_old = nomsg [L694] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=1, mode2=1, mode3=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=23, 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] [L698] COND TRUE ((int)r1) == 2 [L700] COND FALSE !(((int)max1) == ((int)id1)) [L1507] nl1 = 1 [L704] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=1, 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=23, 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] [L706] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=22, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=1, 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=23, 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] [L708] COND FALSE !(r2 == 255) [L714] r2 = r2 + 1 [L715] COND TRUE !(ep12 == 0) [L717] m2 = p12_old [L718] p12_old = nomsg [L719] COND FALSE !(((int)m2) > ((int)max2)) [L723] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=1, mode3=1, 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=23, 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] [L731] COND TRUE ((int)r2) == 2 [L733] COND TRUE ((int)max2) == ((int)id2) [L735] st2 = 1 [L737] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=1, 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=23, 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] [L739] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=1, 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=23, 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] [L741] COND FALSE !(r3 == 255) [L747] r3 = r3 + 1 [L748] COND FALSE !(!(ep13 == 0)) [L756] COND TRUE !(ep23 == 0) [L758] m3 = p23_old [L759] p23_old = nomsg [L760] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=1, 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] [L764] COND TRUE ((int)r3) == 2 [L766] COND TRUE ((int)max3) == ((int)id3) [L768] st3 = 1 [L770] mode3 = 0 [L771] p12_old = p12_new [L772] p12_new = nomsg [L773] p13_old = p13_new [L774] p13_new = nomsg [L775] p21_old = p21_new [L776] p21_new = nomsg [L777] p23_old = p23_new [L778] p23_new = nomsg [L779] p31_old = p31_new [L780] p31_new = nomsg [L781] p32_old = p32_new [L782] p32_new = nomsg [L784] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L785] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1424] check__tmp = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L813] __return_2190 = check__tmp [L814] main__c1 = __return_2190 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L817] _Bool __tmp_4; [L818] __tmp_4 = main__c1 [L819] _Bool assert__arg; [L820] assert__arg = __tmp_4 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L821] COND TRUE assert__arg == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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] [L823] __VERIFIER_error() VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=22, id2=23, id3=24, m1=24, m2=-1, m3=23, max1=24, max2=23, max3=24, mode1=0, mode2=0, mode3=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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.46 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.97 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4409.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.8 MB in the end (delta: 246.5 MB). Peak memory consumption was 246.5 MB. Max. memory is 11.5 GB. * CodeCheck took 788901.28 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 884.8 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 248.97 ms. Allocated memory is still 4.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...