./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.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_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/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 d9ac322b8286f0075601fe20d9ff9aa0453c0fa1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:56:39,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:56:39,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:56:39,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:56:39,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:56:39,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:56:39,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:56:39,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:56:39,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:56:39,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:56:39,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:56:39,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:56:39,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:56:39,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:56:39,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:56:39,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:56:39,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:56:39,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:56:39,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:56:39,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:56:39,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:56:39,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:56:39,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:56:39,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:56:39,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:56:39,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:56:39,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:56:39,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:56:39,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:56:39,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:56:39,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:56:39,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:56:39,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:56:39,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:56:39,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:56:39,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:56:39,461 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 00:56:39,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:56:39,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:56:39,472 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 00:56:39,472 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 00:56:39,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:56:39,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:56:39,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:56:39,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:56:39,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:56:39,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:56:39,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 00:56:39,474 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 00:56:39,475 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 00:56:39,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:56:39,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 00:56:39,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 00:56:39,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:56:39,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 00:56:39,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 00:56:39,476 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 00:56:39,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 00:56:39,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 00:56:39,476 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_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/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 -> d9ac322b8286f0075601fe20d9ff9aa0453c0fa1 [2018-11-10 00:56:39,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:56:39,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:56:39,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:56:39,512 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:56:39,513 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:56:39,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 00:56:39,556 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/data/21ea1f249/987351a66eb94dffa8fda8532883052f/FLAGf7446b6f7 [2018-11-10 00:56:39,930 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:56:39,931 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 00:56:39,941 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/data/21ea1f249/987351a66eb94dffa8fda8532883052f/FLAGf7446b6f7 [2018-11-10 00:56:39,952 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/data/21ea1f249/987351a66eb94dffa8fda8532883052f [2018-11-10 00:56:39,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:56:39,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:56:39,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:56:39,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:56:39,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:56:39,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:39" (1/1) ... [2018-11-10 00:56:39,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7114e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:39, skipping insertion in model container [2018-11-10 00:56:39,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:39" (1/1) ... [2018-11-10 00:56:39,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:56:40,014 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:56:40,246 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:56:40,252 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:56:40,344 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:56:40,357 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:56:40,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40 WrapperNode [2018-11-10 00:56:40,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:56:40,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:56:40,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:56:40,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:56:40,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:56:40,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:56:40,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:56:40,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:56:40,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... [2018-11-10 00:56:40,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:56:40,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:56:40,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:56:40,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:56:40,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 00:56:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:56:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:56:41,969 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:56:41,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:41 BoogieIcfgContainer [2018-11-10 00:56:41,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:56:41,970 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 00:56:41,971 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 00:56:41,980 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 00:56:41,981 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:41" (1/1) ... [2018-11-10 00:56:41,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:56:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 215 states and 378 transitions. [2018-11-10 00:56:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 378 transitions. [2018-11-10 00:56:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 00:56:42,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 221 states and 388 transitions. [2018-11-10 00:56:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 388 transitions. [2018-11-10 00:56:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:42,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 221 states and 387 transitions. [2018-11-10 00:56:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 387 transitions. [2018-11-10 00:56:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 222 states and 388 transitions. [2018-11-10 00:56:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 388 transitions. [2018-11-10 00:56:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 265 states and 473 transitions. [2018-11-10 00:56:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 473 transitions. [2018-11-10 00:56:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 264 states and 471 transitions. [2018-11-10 00:56:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 471 transitions. [2018-11-10 00:56:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 307 states and 555 transitions. [2018-11-10 00:56:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 555 transitions. [2018-11-10 00:56:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 306 states and 552 transitions. [2018-11-10 00:56:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 552 transitions. [2018-11-10 00:56:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:43,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 320 states and 578 transitions. [2018-11-10 00:56:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 578 transitions. [2018-11-10 00:56:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 00:56:46,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 322 states and 582 transitions. [2018-11-10 00:56:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 582 transitions. [2018-11-10 00:56:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 00:56:46,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 319 states and 576 transitions. [2018-11-10 00:56:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 576 transitions. [2018-11-10 00:56:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 00:56:47,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 322 states and 581 transitions. [2018-11-10 00:56:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 581 transitions. [2018-11-10 00:56:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:48,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 322 states and 580 transitions. [2018-11-10 00:56:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 580 transitions. [2018-11-10 00:56:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:48,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 323 states and 581 transitions. [2018-11-10 00:56:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 581 transitions. [2018-11-10 00:56:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 323 states and 580 transitions. [2018-11-10 00:56:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 580 transitions. [2018-11-10 00:56:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,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-11-10 00:56:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 326 states and 585 transitions. [2018-11-10 00:56:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 585 transitions. [2018-11-10 00:56:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,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-11-10 00:56:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 327 states and 585 transitions. [2018-11-10 00:56:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 585 transitions. [2018-11-10 00:56:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 330 states and 590 transitions. [2018-11-10 00:56:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 590 transitions. [2018-11-10 00:56:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 331 states and 590 transitions. [2018-11-10 00:56:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 590 transitions. [2018-11-10 00:56:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:53,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 376 states and 677 transitions. [2018-11-10 00:56:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 677 transitions. [2018-11-10 00:56:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:54,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:56:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:56:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 428 states and 783 transitions. [2018-11-10 00:56:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 783 transitions. [2018-11-10 00:56:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:56:56,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:56:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:56:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 442 states and 811 transitions. [2018-11-10 00:57:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 811 transitions. [2018-11-10 00:57:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:02,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 449 states and 826 transitions. [2018-11-10 00:57:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 826 transitions. [2018-11-10 00:57:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:08,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 452 states and 831 transitions. [2018-11-10 00:57:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 831 transitions. [2018-11-10 00:57:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:08,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 453 states and 831 transitions. [2018-11-10 00:57:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 831 transitions. [2018-11-10 00:57:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:09,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 456 states and 836 transitions. [2018-11-10 00:57:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 836 transitions. [2018-11-10 00:57:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:09,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 457 states and 836 transitions. [2018-11-10 00:57:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 836 transitions. [2018-11-10 00:57:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:09,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 460 states and 841 transitions. [2018-11-10 00:57:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 841 transitions. [2018-11-10 00:57:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:09,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 461 states and 844 transitions. [2018-11-10 00:57:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 844 transitions. [2018-11-10 00:57:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:09,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 504 states and 927 transitions. [2018-11-10 00:57:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 927 transitions. [2018-11-10 00:57:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:11,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:11,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-11-10 00:57:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 503 states and 924 transitions. [2018-11-10 00:57:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 924 transitions. [2018-11-10 00:57:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:11,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 546 states and 1007 transitions. [2018-11-10 00:57:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1007 transitions. [2018-11-10 00:57:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 00:57:15,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 545 states and 1004 transitions. [2018-11-10 00:57:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1004 transitions. [2018-11-10 00:57:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 00:57:15,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 542 states and 995 transitions. [2018-11-10 00:57:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 995 transitions. [2018-11-10 00:57:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 00:57:18,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 494 states and 905 transitions. [2018-11-10 00:57:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 905 transitions. [2018-11-10 00:57:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 00:57:18,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 502 states and 920 transitions. [2018-11-10 00:57:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 920 transitions. [2018-11-10 00:57:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 00:57:21,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:22,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-11-10 00:57:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 509 states and 937 transitions. [2018-11-10 00:57:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 937 transitions. [2018-11-10 00:57:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:24,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 521 states and 957 transitions. [2018-11-10 00:57:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 957 transitions. [2018-11-10 00:57:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:38,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 546 states and 1000 transitions. [2018-11-10 00:57:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1000 transitions. [2018-11-10 00:57:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:55,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 558 states and 1020 transitions. [2018-11-10 00:57:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1020 transitions. [2018-11-10 00:57:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:58,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:58,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-11-10 00:57:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 559 states and 1020 transitions. [2018-11-10 00:57:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1020 transitions. [2018-11-10 00:57:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:58,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:57:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 559 states and 1019 transitions. [2018-11-10 00:57:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1019 transitions. [2018-11-10 00:57:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:57:59,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:57:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 559 states and 1018 transitions. [2018-11-10 00:58:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1018 transitions. [2018-11-10 00:58:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:00,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 565 states and 1026 transitions. [2018-11-10 00:58:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1026 transitions. [2018-11-10 00:58:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:02,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 568 states and 1031 transitions. [2018-11-10 00:58:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1031 transitions. [2018-11-10 00:58:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:02,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 610 states and 1117 transitions. [2018-11-10 00:58:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1117 transitions. [2018-11-10 00:58:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:06,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 627 states and 1149 transitions. [2018-11-10 00:58:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1149 transitions. [2018-11-10 00:58:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:06,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 644 states and 1183 transitions. [2018-11-10 00:58:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1183 transitions. [2018-11-10 00:58:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:08,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 667 states and 1225 transitions. [2018-11-10 00:58:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1225 transitions. [2018-11-10 00:58:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:10,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 668 states and 1225 transitions. [2018-11-10 00:58:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1225 transitions. [2018-11-10 00:58:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:10,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 667 states and 1220 transitions. [2018-11-10 00:58:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1220 transitions. [2018-11-10 00:58:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:10,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 708 states and 1301 transitions. [2018-11-10 00:58:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1301 transitions. [2018-11-10 00:58:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:14,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 711 states and 1306 transitions. [2018-11-10 00:58:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1306 transitions. [2018-11-10 00:58:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:15,537 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 734 states and 1348 transitions. [2018-11-10 00:58:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1348 transitions. [2018-11-10 00:58:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:17,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 736 states and 1349 transitions. [2018-11-10 00:58:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1349 transitions. [2018-11-10 00:58:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:18,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 735 states and 1342 transitions. [2018-11-10 00:58:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1342 transitions. [2018-11-10 00:58:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:18,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 738 states and 1347 transitions. [2018-11-10 00:58:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1347 transitions. [2018-11-10 00:58:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:18,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 739 states and 1347 transitions. [2018-11-10 00:58:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1347 transitions. [2018-11-10 00:58:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:18,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:18,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-11-10 00:58:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 752 states and 1365 transitions. [2018-11-10 00:58:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1365 transitions. [2018-11-10 00:58:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:20,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 754 states and 1368 transitions. [2018-11-10 00:58:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1368 transitions. [2018-11-10 00:58:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:22,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 812 states and 1484 transitions. [2018-11-10 00:58:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1484 transitions. [2018-11-10 00:58:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:46,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 813 states and 1485 transitions. [2018-11-10 00:58:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1485 transitions. [2018-11-10 00:58:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:47,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 820 states and 1496 transitions. [2018-11-10 00:58:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1496 transitions. [2018-11-10 00:58:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:52,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 836 states and 1525 transitions. [2018-11-10 00:58:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1525 transitions. [2018-11-10 00:58:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 00:58:57,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:58:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:58:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 841 states and 1533 transitions. [2018-11-10 00:58:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1533 transitions. [2018-11-10 00:58:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:58:59,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:58:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:58:59,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-11-10 00:59:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 848 states and 1549 transitions. [2018-11-10 00:59:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1549 transitions. [2018-11-10 00:59:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:05,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 848 states and 1548 transitions. [2018-11-10 00:59:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1548 transitions. [2018-11-10 00:59:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:06,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 848 states and 1546 transitions. [2018-11-10 00:59:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1546 transitions. [2018-11-10 00:59:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:07,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 852 states and 1558 transitions. [2018-11-10 00:59:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1558 transitions. [2018-11-10 00:59:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:13,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 852 states and 1557 transitions. [2018-11-10 00:59:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1557 transitions. [2018-11-10 00:59:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:14,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 852 states and 1555 transitions. [2018-11-10 00:59:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1555 transitions. [2018-11-10 00:59:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:15,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 859 states and 1569 transitions. [2018-11-10 00:59:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1569 transitions. [2018-11-10 00:59:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:18,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 863 states and 1578 transitions. [2018-11-10 00:59:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1578 transitions. [2018-11-10 00:59:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:19,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 871 states and 1593 transitions. [2018-11-10 00:59:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1593 transitions. [2018-11-10 00:59:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 00:59:26,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 880 states and 1607 transitions. [2018-11-10 00:59:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1607 transitions. [2018-11-10 00:59:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 00:59:30,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:59:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 00:59:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 880 states and 1605 transitions. [2018-11-10 00:59:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1605 transitions. [2018-11-10 00:59:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 00:59:33,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 00:59:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:59:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 894 states and 1634 transitions. [2018-11-10 01:00:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1634 transitions. [2018-11-10 01:00:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:04,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:04,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-11-10 01:00:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 868 states and 1581 transitions. [2018-11-10 01:00:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1581 transitions. [2018-11-10 01:00:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:05,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 854 states and 1558 transitions. [2018-11-10 01:00:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1558 transitions. [2018-11-10 01:00:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:09,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 858 states and 1564 transitions. [2018-11-10 01:00:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1564 transitions. [2018-11-10 01:00:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:09,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 869 states and 1579 transitions. [2018-11-10 01:00:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1579 transitions. [2018-11-10 01:00:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:14,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:15,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-11-10 01:00:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 858 states and 1563 transitions. [2018-11-10 01:00:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1563 transitions. [2018-11-10 01:00:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:16,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:16,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-11-10 01:00:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 859 states and 1565 transitions. [2018-11-10 01:00:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1565 transitions. [2018-11-10 01:00:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:18,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 864 states and 1571 transitions. [2018-11-10 01:00:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1571 transitions. [2018-11-10 01:00:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:24,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 864 states and 1570 transitions. [2018-11-10 01:00:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1570 transitions. [2018-11-10 01:00:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:31,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 862 states and 1563 transitions. [2018-11-10 01:00:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1563 transitions. [2018-11-10 01:00:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:33,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 846 states and 1536 transitions. [2018-11-10 01:00:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1536 transitions. [2018-11-10 01:00:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:41,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:41,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-11-10 01:00:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 838 states and 1517 transitions. [2018-11-10 01:00:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1517 transitions. [2018-11-10 01:00:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:42,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:43,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-11-10 01:00:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 842 states and 1526 transitions. [2018-11-10 01:00:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1526 transitions. [2018-11-10 01:00:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:44,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 845 states and 1531 transitions. [2018-11-10 01:00:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1531 transitions. [2018-11-10 01:00:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:46,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 858 states and 1553 transitions. [2018-11-10 01:00:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1553 transitions. [2018-11-10 01:00:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:52,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 883 states and 1603 transitions. [2018-11-10 01:00:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1603 transitions. [2018-11-10 01:00:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:58,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:00:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:00:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:00:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 887 states and 1609 transitions. [2018-11-10 01:00:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1609 transitions. [2018-11-10 01:00:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:00:59,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:00:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 887 states and 1608 transitions. [2018-11-10 01:01:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1608 transitions. [2018-11-10 01:01:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:31,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 928 states and 1688 transitions. [2018-11-10 01:01:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1688 transitions. [2018-11-10 01:01:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:33,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,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-11-10 01:01:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 929 states and 1688 transitions. [2018-11-10 01:01:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1688 transitions. [2018-11-10 01:01:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:33,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 928 states and 1685 transitions. [2018-11-10 01:01:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1685 transitions. [2018-11-10 01:01:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:33,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 968 states and 1763 transitions. [2018-11-10 01:01:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1763 transitions. [2018-11-10 01:01:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:33,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 969 states and 1763 transitions. [2018-11-10 01:01:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1763 transitions. [2018-11-10 01:01:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 01:01:33,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 968 states and 1760 transitions. [2018-11-10 01:01:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1760 transitions. [2018-11-10 01:01:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:01:33,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 968 states and 1758 transitions. [2018-11-10 01:01:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1758 transitions. [2018-11-10 01:01:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:01:37,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 962 states and 1743 transitions. [2018-11-10 01:01:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1743 transitions. [2018-11-10 01:01:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:01:39,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 964 states and 1743 transitions. [2018-11-10 01:01:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1743 transitions. [2018-11-10 01:01:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:01:47,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:01:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:01:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 964 states and 1741 transitions. [2018-11-10 01:01:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1741 transitions. [2018-11-10 01:01:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:01:51,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:01:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:01:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 959 states and 1732 transitions. [2018-11-10 01:02:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1732 transitions. [2018-11-10 01:02:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:02:07,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:02:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 961 states and 1735 transitions. [2018-11-10 01:02:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1735 transitions. [2018-11-10 01:02:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:02:11,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:02:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 957 states and 1724 transitions. [2018-11-10 01:02:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1724 transitions. [2018-11-10 01:02:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:02:13,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:02:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 817 states and 1462 transitions. [2018-11-10 01:02:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1462 transitions. [2018-11-10 01:02:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:02:19,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:02:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 750 states and 1339 transitions. [2018-11-10 01:02:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1339 transitions. [2018-11-10 01:02:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 01:02:27,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:02:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:02:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 01:02:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 806 states and 1448 transitions. [2018-11-10 01:02:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1448 transitions. [2018-11-10 01:02:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 01:02:45,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 01:02:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:02:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:02:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:02:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:02:46,329 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-11-10 01:02:46,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 01:02:46 ImpRootNode [2018-11-10 01:02:46,464 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 01:02:46,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:02:46,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:02:46,464 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:02:46,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:41" (3/4) ... [2018-11-10 01:02:46,468 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:02:46,657 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2cdb1325-13b6-4cfe-bdba-bd8f1dd539c1/bin-2019/ukojak/witness.graphml [2018-11-10 01:02:46,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:02:46,658 INFO L168 Benchmark]: Toolchain (without parser) took 366702.67 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 730.3 MB). Free memory was 956.4 MB in the beginning and 1.4 GB in the end (delta: -452.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,659 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:02:46,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.94 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -221.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,660 INFO L168 Benchmark]: Boogie Preprocessor took 35.25 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-11-10 01:02:46,660 INFO L168 Benchmark]: RCFGBuilder took 1490.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,660 INFO L168 Benchmark]: CodeCheck took 364493.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 535.3 MB). Free memory was 896.5 MB in the beginning and 593.0 MB in the end (delta: 303.5 MB). Peak memory consumption was 838.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,660 INFO L168 Benchmark]: Witness Printer took 193.72 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 36.7 MB). Free memory was 593.0 MB in the beginning and 1.4 GB in the end (delta: -815.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:02:46,662 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, 294 locations, 1 error locations. UNSAFE Result, 364.3s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2050525224 SDtfs, -219927260 SDslu, -659684756 SDs, 0 SdLazy, -1029591886 SolverSat, 287769294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 122.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103224 GetRequests, 100639 SyntacticMatches, 1131 SemanticMatches, 1454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111565 ImplicationChecksByTransitivity, 354.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 13085 NumberOfCodeBlocks, 13085 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 12851 ConstructedInterpolants, 0 QuantifiedInterpolants, 6214996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 109 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: 804]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L64] int __return_1709; [L65] int __return_1837; [L66] int __return_1955; [L67] int __return_2060; [L68] int __return_2183; [L69] int __tmp_2184_0; [L70] int __return_2292; [L71] int __return_2197; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L16] port_t p13 = 0; [L20] port_t p21 = 0; [L24] port_t p23 = 0; [L28] port_t p31 = 0; [L32] port_t p32 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_char() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] id2 = __VERIFIER_nondet_char() [L91] r2 = __VERIFIER_nondet_char() [L92] st2 = __VERIFIER_nondet_char() [L93] nl2 = __VERIFIER_nondet_char() [L94] m2 = __VERIFIER_nondet_char() [L95] max2 = __VERIFIER_nondet_char() [L96] mode2 = __VERIFIER_nondet_bool() [L97] id3 = __VERIFIER_nondet_char() [L98] r3 = __VERIFIER_nondet_char() [L99] st3 = __VERIFIER_nondet_char() [L100] nl3 = __VERIFIER_nondet_char() [L101] m3 = __VERIFIER_nondet_char() [L102] max3 = __VERIFIER_nondet_char() [L103] mode3 = __VERIFIER_nondet_bool() [L105] _Bool init__r121; [L106] _Bool init__r131; [L107] _Bool init__r211; [L108] _Bool init__r231; [L109] _Bool init__r311; [L110] _Bool init__r321; [L111] _Bool init__r122; [L112] int init__tmp; [L113] _Bool init__r132; [L114] int init__tmp___0; [L115] _Bool init__r212; [L116] int init__tmp___1; [L117] _Bool init__r232; [L118] int init__tmp___2; [L119] _Bool init__r312; [L120] int init__tmp___3; [L121] _Bool init__r322; [L122] int init__tmp___4; [L123] int init__tmp___5; [L124] init__r121 = ep12 [L125] init__r131 = ep13 [L126] init__r211 = ep21 [L127] init__r231 = ep23 [L128] init__r311 = ep31 [L129] init__r321 = ep32 [L130] COND TRUE !(init__r121 == 0) [L132] init__tmp = 1 [L134] init__r122 = (_Bool)init__tmp [L135] COND FALSE !(!(init__r131 == 0)) [L2183] COND TRUE !(init__r121 == 0) [L2185] COND TRUE !(ep23 == 0) [L2187] init__tmp___0 = 1 [L139] init__r132 = (_Bool)init__tmp___0 [L140] COND FALSE !(!(init__r211 == 0)) [L2160] COND TRUE !(init__r231 == 0) [L2162] COND TRUE !(ep31 == 0) [L2164] init__tmp___1 = 1 [L144] init__r212 = (_Bool)init__tmp___1 [L145] COND TRUE !(init__r231 == 0) [L147] init__tmp___2 = 1 [L149] init__r232 = (_Bool)init__tmp___2 [L150] COND TRUE !(init__r311 == 0) [L152] init__tmp___3 = 1 [L154] init__r312 = (_Bool)init__tmp___3 [L155] COND FALSE !(!(init__r321 == 0)) [L2091] COND TRUE !(init__r311 == 0) [L2093] COND TRUE !(ep12 == 0) [L2095] init__tmp___4 = 1 [L159] init__r322 = (_Bool)init__tmp___4 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L160] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L162] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L164] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L166] COND TRUE ((int)id1) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L168] COND TRUE ((int)id2) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L170] COND TRUE ((int)id3) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L172] COND TRUE ((int)r1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L174] COND TRUE ((int)r2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L176] COND TRUE ((int)r3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L178] COND TRUE !(init__r122 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L180] COND TRUE !(init__r132 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L182] COND TRUE !(init__r212 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L184] COND TRUE !(init__r232 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L186] COND TRUE !(init__r312 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L188] COND TRUE !(init__r322 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L190] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L192] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L194] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L196] COND TRUE ((int)st1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L198] COND TRUE ((int)st2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L200] COND TRUE ((int)st3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L202] COND TRUE ((int)nl1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L204] COND TRUE ((int)nl2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L206] COND TRUE ((int)nl3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L208] COND TRUE ((int)mode1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L210] COND TRUE ((int)mode2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L212] COND TRUE ((int)mode3) == 0 [L214] init__tmp___5 = 1 [L215] __return_1709 = init__tmp___5 [L216] main__i2 = __return_1709 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L217] COND TRUE main__i2 != 0 [L219] p12_old = nomsg [L220] p12_new = nomsg [L221] p13_old = nomsg [L222] p13_new = nomsg [L223] p21_old = nomsg [L224] p21_new = nomsg [L225] p23_old = nomsg [L226] p23_new = nomsg [L227] p31_old = nomsg [L228] p31_new = nomsg [L229] p32_old = nomsg [L230] p32_new = nomsg [L231] main__i2 = 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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 TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L235] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L241] COND TRUE ((int)r1) < 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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 !(ep12 == 0) [L245] int node1____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L246] COND TRUE max1 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L248] COND TRUE p12_new == nomsg [L250] node1____CPAchecker_TMP_0 = max1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, 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] [L252] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep13 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L265] mode1 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L273] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L275] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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 !(ep23 == 0) [L288] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L289] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L291] COND TRUE p23_new == nomsg [L293] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L295] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L297] mode2 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L299] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L305] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L307] COND TRUE !(ep31 == 0) [L309] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L310] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L312] COND TRUE p31_new == nomsg [L314] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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] [L316] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, 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=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] mode3 = 1 [L330] p12_old = p12_new [L331] p12_new = nomsg [L332] p13_old = p13_new [L333] p13_new = nomsg [L334] p21_old = p21_new [L335] p21_new = nomsg [L336] p23_old = p23_new [L337] p23_new = nomsg [L338] p31_old = p31_new [L339] p31_new = nomsg [L340] p32_old = p32_new [L341] p32_new = nomsg [L343] int check__tmp; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L352] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((int)r1) < 2 [L372] check__tmp = 1 [L373] __return_1837 = check__tmp [L374] main__c1 = __return_1837 [L376] _Bool __tmp_1; [L377] __tmp_1 = main__c1 [L378] _Bool assert__arg; [L379] assert__arg = __tmp_1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(assert__arg == 0) [L386] int main____CPAchecker_TMP_0 = main__i2; [L387] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=0, m2=-128, m3=-128, max1=0, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND TRUE !(mode1 == 0) [L393] r1 = (char)(((int)r1) + 1) [L394] COND FALSE !(!(ep21 == 0)) [L402] COND TRUE !(ep31 == 0) [L404] m1 = p31_old [L405] p31_old = nomsg [L406] COND TRUE ((int)m1) > ((int)max1) [L408] max1 = m1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-128, m3=-128, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)r1) == 2) [L416] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-128, m3=-128, max1=3, max2=1, max3=3, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE !(mode2 == 0) [L420] r2 = (char)(((int)r2) + 1) [L421] COND TRUE !(ep12 == 0) [L423] m2 = p12_old [L424] p12_old = nomsg [L425] COND FALSE !(((int)m2) > ((int)max2)) [L429] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=-128, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)r2) == 2) [L443] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=-128, max1=3, max2=1, max3=3, 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=0, st1=0, st2=0, st3=0] [L445] COND TRUE !(mode3 == 0) [L447] r3 = (char)(((int)r3) + 1) [L448] COND FALSE !(!(ep13 == 0)) [L456] COND TRUE !(ep23 == 0) [L458] m3 = p23_old [L459] p23_old = nomsg [L460] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L464] COND FALSE !(((int)r3) == 2) [L470] mode3 = 0 [L471] p12_old = p12_new [L472] p12_new = nomsg [L473] p13_old = p13_new [L474] p13_new = nomsg [L475] p21_old = p21_new [L476] p21_new = nomsg [L477] p23_old = p23_new [L478] p23_new = nomsg [L479] p31_old = p31_new [L480] p31_new = nomsg [L481] p32_old = p32_new [L482] p32_new = nomsg [L484] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L485] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L487] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L489] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L491] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L493] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L499] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L501] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L503] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L509] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L511] COND TRUE ((int)r1) < 2 [L513] check__tmp = 1 [L514] __return_1955 = check__tmp [L515] main__c1 = __return_1955 [L517] _Bool __tmp_2; [L518] __tmp_2 = main__c1 [L519] _Bool assert__arg; [L520] assert__arg = __tmp_2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L521] COND FALSE !(assert__arg == 0) [L527] int main____CPAchecker_TMP_0 = main__i2; [L528] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L529] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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 !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L538] COND FALSE !(((int)r1) < 1) [L544] mode1 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L546] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L552] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L554] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L565] COND TRUE !(ep23 == 0) [L567] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L568] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L570] COND TRUE p23_new == nomsg [L572] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L574] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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] [L576] mode2 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=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] [L578] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=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] [L584] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] COND TRUE !(ep31 == 0) [L588] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=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] [L589] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=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] [L591] COND TRUE p31_new == nomsg [L593] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=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] [L595] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L608] mode3 = 1 [L609] p12_old = p12_new [L610] p12_new = nomsg [L611] p13_old = p13_new [L612] p13_new = nomsg [L613] p21_old = p21_new [L614] p21_new = nomsg [L615] p23_old = p23_new [L616] p23_new = nomsg [L617] p31_old = p31_new [L618] p31_new = nomsg [L619] p32_old = p32_new [L620] p32_new = nomsg [L622] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L623] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L625] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L627] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L631] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L637] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L647] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L649] COND TRUE ((int)r1) < 2 [L651] check__tmp = 1 [L652] __return_2060 = check__tmp [L653] main__c1 = __return_2060 [L655] _Bool __tmp_3; [L656] __tmp_3 = main__c1 [L657] _Bool assert__arg; [L658] assert__arg = __tmp_3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L659] COND FALSE !(assert__arg == 0) [L665] int main____CPAchecker_TMP_0 = main__i2; [L666] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L667] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L670] COND TRUE !(mode1 == 0) [L672] r1 = (char)(((int)r1) + 1) [L673] COND FALSE !(!(ep21 == 0)) [L681] COND TRUE !(ep31 == 0) [L683] m1 = p31_old [L684] p31_old = nomsg [L685] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L689] COND TRUE ((int)r1) == 2 [L691] COND FALSE !(((int)max1) == ((int)id1)) [L1470] nl1 = 1 [L695] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=0, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L697] COND TRUE !(mode2 == 0) [L699] r2 = (char)(((int)r2) + 1) [L700] COND TRUE !(ep12 == 0) [L702] m2 = p12_old [L703] p12_old = nomsg [L704] COND FALSE !(((int)m2) > ((int)max2)) [L708] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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=1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L716] COND TRUE ((int)r2) == 2 [L718] COND TRUE ((int)max2) == ((int)id2) [L720] st2 = 1 [L722] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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=1, st1=0, st2=1, st3=0] [L724] COND TRUE !(mode3 == 0) [L726] r3 = (char)(((int)r3) + 1) [L727] COND FALSE !(!(ep13 == 0)) [L735] COND TRUE !(ep23 == 0) [L737] m3 = p23_old [L738] p23_old = nomsg [L739] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L743] COND TRUE ((int)r3) == 2 [L745] COND TRUE ((int)max3) == ((int)id3) [L747] st3 = 1 [L749] mode3 = 0 [L750] p12_old = p12_new [L751] p12_new = nomsg [L752] p13_old = p13_new [L753] p13_new = nomsg [L754] p21_old = p21_new [L755] p21_new = nomsg [L756] p23_old = p23_new [L757] p23_new = nomsg [L758] p31_old = p31_new [L759] p31_new = nomsg [L760] p32_old = p32_new [L761] p32_new = nomsg [L763] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L764] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1389] check__tmp = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L792] __return_2183 = check__tmp [L793] main__c1 = __return_2183 [L794] __tmp_2184_0 = main____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L796] main____CPAchecker_TMP_0 = __tmp_2184_0 [L798] _Bool __tmp_4; [L799] __tmp_4 = main__c1 [L800] _Bool assert__arg; [L801] assert__arg = __tmp_4 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L802] COND TRUE assert__arg == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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] [L804] __VERIFIER_error() VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=3, m1=3, m2=-1, m3=1, max1=3, max2=1, max3=3, 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.94 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 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 85.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -221.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.25 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 1490.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. * CodeCheck took 364493.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 535.3 MB). Free memory was 896.5 MB in the beginning and 593.0 MB in the end (delta: 303.5 MB). Peak memory consumption was 838.8 MB. Max. memory is 11.5 GB. * Witness Printer took 193.72 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 36.7 MB). Free memory was 593.0 MB in the beginning and 1.4 GB in the end (delta: -815.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...