./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.3.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.3.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/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 cfb862fa2ad5fbe7ae50d5d94edacc20887b054e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:37:30,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:37:30,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:37:30,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:37:30,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:37:30,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:37:30,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:37:30,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:37:30,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:37:30,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:37:30,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:37:30,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:37:30,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:37:30,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:37:30,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:37:30,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:37:30,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:37:30,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:37:30,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:37:30,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:37:30,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:37:30,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:37:30,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:37:30,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:37:30,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:37:30,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:37:30,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:37:30,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:37:30,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:37:30,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:37:30,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:37:30,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:37:30,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:37:30,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:37:30,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:37:30,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:37:30,627 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-27 00:37:30,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:37:30,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:37:30,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:37:30,640 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:37:30,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:37:30,640 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:37:30,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:37:30,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:37:30,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:37:30,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:37:30,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:37:30,644 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-27 00:37:30,644 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-27 00:37:30,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:37:30,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:37:30,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:37:30,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:37:30,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:37:30,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:37:30,645 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-27 00:37:30,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:37:30,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:37:30,645 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_0c6371dc-349c-420a-ab71-a259c33338a4/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 -> cfb862fa2ad5fbe7ae50d5d94edacc20887b054e [2018-10-27 00:37:30,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:37:30,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:37:30,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:37:30,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:37:30,711 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:37:30,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.3.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 00:37:30,764 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/data/a25af65ef/6cd8a7d4c8e64d1496f328f8ddf3527b/FLAG5065f4164 [2018-10-27 00:37:31,196 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:37:31,196 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.3.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 00:37:31,208 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/data/a25af65ef/6cd8a7d4c8e64d1496f328f8ddf3527b/FLAG5065f4164 [2018-10-27 00:37:31,225 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/data/a25af65ef/6cd8a7d4c8e64d1496f328f8ddf3527b [2018-10-27 00:37:31,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:37:31,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:37:31,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:37:31,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:37:31,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:37:31,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51583821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31, skipping insertion in model container [2018-10-27 00:37:31,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:37:31,294 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:37:31,555 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:37:31,563 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:37:31,645 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:37:31,673 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:37:31,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31 WrapperNode [2018-10-27 00:37:31,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:37:31,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:37:31,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:37:31,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:37:31,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:37:31,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:37:31,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:37:31,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:37:31,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... [2018-10-27 00:37:31,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:37:31,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:37:31,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:37:31,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:37:31,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:37:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:37:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:37:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:37:38,559 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:37:38,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:37:38 BoogieIcfgContainer [2018-10-27 00:37:38,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:37:38,560 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-27 00:37:38,560 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-27 00:37:38,570 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-27 00:37:38,571 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:37:38" (1/1) ... [2018-10-27 00:37:38,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:37:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 142 states and 227 transitions. [2018-10-27 00:37:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 227 transitions. [2018-10-27 00:37:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 00:37:38,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2018-10-27 00:37:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2018-10-27 00:37:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 00:37:39,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:39,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-10-27 00:37:40,343 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 00:37:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 149 states and 239 transitions. [2018-10-27 00:37:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 239 transitions. [2018-10-27 00:37:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 00:37:40,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 154 states and 249 transitions. [2018-10-27 00:37:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 249 transitions. [2018-10-27 00:37:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 00:37:41,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 160 states and 261 transitions. [2018-10-27 00:37:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 261 transitions. [2018-10-27 00:37:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-27 00:37:42,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:43,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-10-27 00:37:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 167 states and 275 transitions. [2018-10-27 00:37:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 275 transitions. [2018-10-27 00:37:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 00:37:43,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 176 states and 291 transitions. [2018-10-27 00:37:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 291 transitions. [2018-10-27 00:37:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 00:37:45,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 184 states and 306 transitions. [2018-10-27 00:37:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 306 transitions. [2018-10-27 00:37:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 00:37:46,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 185 states and 306 transitions. [2018-10-27 00:37:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 306 transitions. [2018-10-27 00:37:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 00:37:47,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 186 states and 307 transitions. [2018-10-27 00:37:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 307 transitions. [2018-10-27 00:37:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 00:37:47,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:48,633 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-27 00:37:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 198 states and 327 transitions. [2018-10-27 00:37:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 327 transitions. [2018-10-27 00:37:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 00:37:51,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 201 states and 331 transitions. [2018-10-27 00:37:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 331 transitions. [2018-10-27 00:37:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-27 00:37:51,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:37:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:37:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 220 states and 369 transitions. [2018-10-27 00:37:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 369 transitions. [2018-10-27 00:37:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 00:37:57,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:37:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:37:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 240 states and 410 transitions. [2018-10-27 00:38:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 410 transitions. [2018-10-27 00:38:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 00:38:03,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 241 states and 411 transitions. [2018-10-27 00:38:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 411 transitions. [2018-10-27 00:38:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 00:38:04,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 262 states and 453 transitions. [2018-10-27 00:38:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 453 transitions. [2018-10-27 00:38:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 00:38:09,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 263 states and 456 transitions. [2018-10-27 00:38:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 456 transitions. [2018-10-27 00:38:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 00:38:10,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 264 states and 457 transitions. [2018-10-27 00:38:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 457 transitions. [2018-10-27 00:38:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 00:38:11,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 286 states and 501 transitions. [2018-10-27 00:38:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 501 transitions. [2018-10-27 00:38:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 00:38:16,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 288 states and 507 transitions. [2018-10-27 00:38:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 507 transitions. [2018-10-27 00:38:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 00:38:17,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 289 states and 508 transitions. [2018-10-27 00:38:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 508 transitions. [2018-10-27 00:38:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 00:38:18,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 290 states and 509 transitions. [2018-10-27 00:38:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 509 transitions. [2018-10-27 00:38:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:19,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 306 states and 539 transitions. [2018-10-27 00:38:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 539 transitions. [2018-10-27 00:38:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:26,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 308 states and 549 transitions. [2018-10-27 00:38:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 549 transitions. [2018-10-27 00:38:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:27,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 310 states and 552 transitions. [2018-10-27 00:38:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 552 transitions. [2018-10-27 00:38:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:28,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 311 states and 553 transitions. [2018-10-27 00:38:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 553 transitions. [2018-10-27 00:38:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:29,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 312 states and 559 transitions. [2018-10-27 00:38:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 559 transitions. [2018-10-27 00:38:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:30,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 313 states and 560 transitions. [2018-10-27 00:38:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 560 transitions. [2018-10-27 00:38:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 00:38:31,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 314 states and 561 transitions. [2018-10-27 00:38:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 561 transitions. [2018-10-27 00:38:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:32,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 325 states and 588 transitions. [2018-10-27 00:38:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 588 transitions. [2018-10-27 00:38:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:39,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 327 states and 591 transitions. [2018-10-27 00:38:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 591 transitions. [2018-10-27 00:38:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:41,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:44,123 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-10-27 00:38:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 331 states and 599 transitions. [2018-10-27 00:38:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 599 transitions. [2018-10-27 00:38:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:46,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 332 states and 600 transitions. [2018-10-27 00:38:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 600 transitions. [2018-10-27 00:38:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:46,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 333 states and 601 transitions. [2018-10-27 00:38:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 601 transitions. [2018-10-27 00:38:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:47,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 334 states and 602 transitions. [2018-10-27 00:38:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 602 transitions. [2018-10-27 00:38:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:48,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 335 states and 603 transitions. [2018-10-27 00:38:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 603 transitions. [2018-10-27 00:38:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:38:49,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 336 states and 604 transitions. [2018-10-27 00:38:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 604 transitions. [2018-10-27 00:38:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 00:38:50,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:38:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:38:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 359 states and 643 transitions. [2018-10-27 00:38:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 643 transitions. [2018-10-27 00:38:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 00:38:57,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:38:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:38:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 365 states and 656 transitions. [2018-10-27 00:39:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 656 transitions. [2018-10-27 00:39:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 00:39:01,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:05,125 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-27 00:39:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 381 states and 676 transitions. [2018-10-27 00:39:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 676 transitions. [2018-10-27 00:39:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 00:39:06,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 387 states and 692 transitions. [2018-10-27 00:39:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 692 transitions. [2018-10-27 00:39:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 00:39:10,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:17,558 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-27 00:39:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 419 states and 780 transitions. [2018-10-27 00:39:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 780 transitions. [2018-10-27 00:39:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 00:39:25,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 425 states and 799 transitions. [2018-10-27 00:39:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 799 transitions. [2018-10-27 00:39:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 00:39:29,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 439 states and 831 transitions. [2018-10-27 00:39:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 831 transitions. [2018-10-27 00:39:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 00:39:37,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 449 states and 849 transitions. [2018-10-27 00:39:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 849 transitions. [2018-10-27 00:39:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:39:44,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:39:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 466 states and 893 transitions. [2018-10-27 00:39:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 893 transitions. [2018-10-27 00:39:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:39:56,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:39:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 476 states and 917 transitions. [2018-10-27 00:40:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 917 transitions. [2018-10-27 00:40:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:40:01,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 486 states and 950 transitions. [2018-10-27 00:40:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 950 transitions. [2018-10-27 00:40:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:40:06,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 488 states and 968 transitions. [2018-10-27 00:40:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 968 transitions. [2018-10-27 00:40:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:08,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 505 states and 1019 transitions. [2018-10-27 00:40:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1019 transitions. [2018-10-27 00:40:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:19,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 516 states and 1058 transitions. [2018-10-27 00:40:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1058 transitions. [2018-10-27 00:40:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:25,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 526 states and 1090 transitions. [2018-10-27 00:40:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1090 transitions. [2018-10-27 00:40:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:30,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 536 states and 1115 transitions. [2018-10-27 00:40:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1115 transitions. [2018-10-27 00:40:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:37,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 538 states and 1120 transitions. [2018-10-27 00:40:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1120 transitions. [2018-10-27 00:40:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:40:38,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 540 states and 1134 transitions. [2018-10-27 00:40:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1134 transitions. [2018-10-27 00:40:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:40:41,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:40:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 557 states and 1197 transitions. [2018-10-27 00:40:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1197 transitions. [2018-10-27 00:40:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:40:58,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:40:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 568 states and 1233 transitions. [2018-10-27 00:41:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1233 transitions. [2018-10-27 00:41:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:41:04,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:08,663 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-10-27 00:41:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 578 states and 1259 transitions. [2018-10-27 00:41:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1259 transitions. [2018-10-27 00:41:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:41:11,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 580 states and 1264 transitions. [2018-10-27 00:41:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1264 transitions. [2018-10-27 00:41:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:41:13,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 582 states and 1268 transitions. [2018-10-27 00:41:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1268 transitions. [2018-10-27 00:41:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:41:14,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 584 states and 1274 transitions. [2018-10-27 00:41:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1274 transitions. [2018-10-27 00:41:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:41:15,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:18,676 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-27 00:41:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 594 states and 1296 transitions. [2018-10-27 00:41:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1296 transitions. [2018-10-27 00:41:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:22,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:28,568 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-27 00:41:36,036 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-10-27 00:41:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 625 states and 1369 transitions. [2018-10-27 00:41:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1369 transitions. [2018-10-27 00:41:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:43,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 628 states and 1393 transitions. [2018-10-27 00:41:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1393 transitions. [2018-10-27 00:41:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:46,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:47,341 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-10-27 00:41:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 631 states and 1419 transitions. [2018-10-27 00:41:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1419 transitions. [2018-10-27 00:41:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:49,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 632 states and 1437 transitions. [2018-10-27 00:41:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1437 transitions. [2018-10-27 00:41:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:51,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 634 states and 1441 transitions. [2018-10-27 00:41:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1441 transitions. [2018-10-27 00:41:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:41:53,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:41:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 636 states and 1445 transitions. [2018-10-27 00:41:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1445 transitions. [2018-10-27 00:41:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:41:54,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:41:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 641 states and 1457 transitions. [2018-10-27 00:42:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1457 transitions. [2018-10-27 00:42:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:42:01,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 647 states and 1486 transitions. [2018-10-27 00:42:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1486 transitions. [2018-10-27 00:42:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:42:06,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 652 states and 1511 transitions. [2018-10-27 00:42:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1511 transitions. [2018-10-27 00:42:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:42:11,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 656 states and 1534 transitions. [2018-10-27 00:42:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1534 transitions. [2018-10-27 00:42:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:42:14,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 658 states and 1543 transitions. [2018-10-27 00:42:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1543 transitions. [2018-10-27 00:42:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:42:15,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:27,763 WARN L179 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 00:42:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 679 states and 1596 transitions. [2018-10-27 00:42:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1596 transitions. [2018-10-27 00:42:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:42:34,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 685 states and 1628 transitions. [2018-10-27 00:42:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1628 transitions. [2018-10-27 00:42:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:42:40,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 687 states and 1633 transitions. [2018-10-27 00:42:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1633 transitions. [2018-10-27 00:42:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:42:42,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:42:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 692 states and 1661 transitions. [2018-10-27 00:42:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1661 transitions. [2018-10-27 00:42:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:42:46,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:42:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:55,301 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-10-27 00:42:56,615 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-10-27 00:42:57,980 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-10-27 00:42:59,377 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-10-27 00:43:02,877 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-10-27 00:43:04,499 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-27 00:43:12,616 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-10-27 00:43:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:43:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 724 states and 1763 transitions. [2018-10-27 00:43:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1763 transitions. [2018-10-27 00:43:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:43:25,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:43:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:43:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 732 states and 1785 transitions. [2018-10-27 00:43:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1785 transitions. [2018-10-27 00:43:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:43:35,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:43:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:43:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 738 states and 1803 transitions. [2018-10-27 00:43:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1803 transitions. [2018-10-27 00:43:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:43:41,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:43:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:43,532 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-10-27 00:43:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:43:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 745 states and 1822 transitions. [2018-10-27 00:43:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1822 transitions. [2018-10-27 00:43:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:43:49,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:43:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:43:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 750 states and 1841 transitions. [2018-10-27 00:43:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1841 transitions. [2018-10-27 00:43:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:43:55,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:43:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:43:58,718 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-27 00:44:00,108 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-27 00:44:01,549 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-27 00:44:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 782 states and 1926 transitions. [2018-10-27 00:44:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1926 transitions. [2018-10-27 00:44:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:21,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 783 states and 1927 transitions. [2018-10-27 00:44:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1927 transitions. [2018-10-27 00:44:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:23,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 790 states and 1951 transitions. [2018-10-27 00:44:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1951 transitions. [2018-10-27 00:44:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:30,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 792 states and 1954 transitions. [2018-10-27 00:44:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1954 transitions. [2018-10-27 00:44:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:33,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 793 states and 1955 transitions. [2018-10-27 00:44:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1955 transitions. [2018-10-27 00:44:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:35,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 798 states and 1969 transitions. [2018-10-27 00:44:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1969 transitions. [2018-10-27 00:44:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:39,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 803 states and 1983 transitions. [2018-10-27 00:44:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1983 transitions. [2018-10-27 00:44:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:44:44,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 00:44:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:44:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 808 states and 2000 transitions. [2018-10-27 00:44:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2000 transitions. [2018-10-27 00:44:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:44:48,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:44:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:56,415 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2018-10-27 00:45:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:18,431 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-27 00:45:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 840 states and 2080 transitions. [2018-10-27 00:45:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2080 transitions. [2018-10-27 00:45:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:45:36,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:45:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 841 states and 2081 transitions. [2018-10-27 00:45:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2081 transitions. [2018-10-27 00:45:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:45:38,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:45:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 843 states and 2083 transitions. [2018-10-27 00:45:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 2083 transitions. [2018-10-27 00:45:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:45:42,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:45:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 849 states and 2099 transitions. [2018-10-27 00:45:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2099 transitions. [2018-10-27 00:45:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:45:47,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:45:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 855 states and 2113 transitions. [2018-10-27 00:45:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2113 transitions. [2018-10-27 00:45:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:45:51,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:45:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:45:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:45:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 861 states and 2127 transitions. [2018-10-27 00:45:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2127 transitions. [2018-10-27 00:45:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:45:56,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:45:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:46:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:46:13,716 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-10-27 00:46:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:46:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 883 states and 2172 transitions. [2018-10-27 00:46:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 2172 transitions. [2018-10-27 00:46:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:46:27,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:46:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:46:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:46:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:46:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 890 states and 2187 transitions. [2018-10-27 00:46:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 2187 transitions. [2018-10-27 00:46:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:46:32,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:46:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:46:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:46:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:46:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 895 states and 2195 transitions. [2018-10-27 00:46:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2195 transitions. [2018-10-27 00:46:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:46:36,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:46:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:46:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:46:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:46:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 900 states and 2203 transitions. [2018-10-27 00:46:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2203 transitions. [2018-10-27 00:46:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:46:39,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:46:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:46:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:46:43,089 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-27 00:46:45,793 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-27 00:46:47,481 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-27 00:47:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 925 states and 2246 transitions. [2018-10-27 00:47:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 2246 transitions. [2018-10-27 00:47:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:47:02,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 926 states and 2246 transitions. [2018-10-27 00:47:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2246 transitions. [2018-10-27 00:47:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:47:04,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:13,136 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-27 00:47:15,047 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-10-27 00:47:24,000 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2018-10-27 00:47:29,003 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-10-27 00:47:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 958 states and 2295 transitions. [2018-10-27 00:47:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2295 transitions. [2018-10-27 00:47:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:47:30,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 966 states and 2308 transitions. [2018-10-27 00:47:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2308 transitions. [2018-10-27 00:47:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:47:36,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 982 states and 2327 transitions. [2018-10-27 00:47:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2327 transitions. [2018-10-27 00:47:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:47:51,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:47:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:47:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 990 states and 2335 transitions. [2018-10-27 00:47:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2335 transitions. [2018-10-27 00:47:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 00:47:57,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:47:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 21 proven. 96 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:48:02,412 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2018-10-27 00:48:05,958 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-10-27 00:48:08,232 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-10-27 00:48:09,853 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-10-27 00:48:11,661 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-10-27 00:48:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 1004 states and 2375 transitions. [2018-10-27 00:48:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2375 transitions. [2018-10-27 00:48:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 00:48:16,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 21 proven. 96 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:48:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1006 states and 2385 transitions. [2018-10-27 00:48:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2385 transitions. [2018-10-27 00:48:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 00:48:18,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 21 proven. 96 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:48:20,565 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-10-27 00:48:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 1008 states and 2393 transitions. [2018-10-27 00:48:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2393 transitions. [2018-10-27 00:48:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 00:48:21,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 21 proven. 96 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:48:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 1010 states and 2402 transitions. [2018-10-27 00:48:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2402 transitions. [2018-10-27 00:48:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:48:23,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 92 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 00:48:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1013 states and 2408 transitions. [2018-10-27 00:48:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2408 transitions. [2018-10-27 00:48:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:48:32,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 92 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 00:48:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 1015 states and 2411 transitions. [2018-10-27 00:48:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2411 transitions. [2018-10-27 00:48:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:48:34,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 92 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 00:48:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 1017 states and 2414 transitions. [2018-10-27 00:48:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2414 transitions. [2018-10-27 00:48:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:48:36,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 92 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 00:48:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 1019 states and 2417 transitions. [2018-10-27 00:48:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2417 transitions. [2018-10-27 00:48:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 00:48:38,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:48:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 1022 states and 2433 transitions. [2018-10-27 00:48:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2433 transitions. [2018-10-27 00:48:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 00:48:53,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:48:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 1024 states and 2436 transitions. [2018-10-27 00:48:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2436 transitions. [2018-10-27 00:48:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 00:48:56,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:48:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:48:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1026 states and 2439 transitions. [2018-10-27 00:48:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 2439 transitions. [2018-10-27 00:48:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 00:48:58,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:48:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:48:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:49:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:49:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 1028 states and 2442 transitions. [2018-10-27 00:49:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 2442 transitions. [2018-10-27 00:49:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 00:49:00,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:49:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:49:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:49:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:49:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:49:10,990 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 118 iterations. [2018-10-27 00:49:11,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 27.10 12:49:11 ImpRootNode [2018-10-27 00:49:11,246 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-27 00:49:11,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:49:11,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:49:11,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:49:11,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:37:38" (3/4) ... [2018-10-27 00:49:11,249 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 00:49:11,524 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0c6371dc-349c-420a-ab71-a259c33338a4/bin-2019/ukojak/witness.graphml [2018-10-27 00:49:11,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:49:11,526 INFO L168 Benchmark]: Toolchain (without parser) took 700296.79 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 958.0 MB in the beginning and 604.7 MB in the end (delta: 353.4 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,526 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-10-27 00:49:11,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.82 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 931.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,527 INFO L168 Benchmark]: Boogie Preprocessor took 49.46 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,527 INFO L168 Benchmark]: RCFGBuilder took 6680.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 264.5 MB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,527 INFO L168 Benchmark]: CodeCheck took 692685.59 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 676.9 MB in the end (delta: 407.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,527 INFO L168 Benchmark]: Witness Printer took 277.79 ms. Allocated memory is still 4.8 GB. Free memory was 676.9 MB in the beginning and 604.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2018-10-27 00:49:11,532 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, 303 locations, 1 error locations. UNSAFE Result, 692.3s OverallTime, 118 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130932220 SDtfs, -1881930392 SDslu, -1263984208 SDs, 0 SdLazy, 1453367680 SolverSat, -1683291184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1040.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98379 GetRequests, 92488 SyntacticMatches, 3605 SemanticMatches, 2286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3342375 ImplicationChecksByTransitivity, 636.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.8s SsaConstructionTime, 11.5s SatisfiabilityAnalysisTime, 85.9s InterpolantComputationTime, 10854 NumberOfCodeBlocks, 10854 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 10602 ConstructedInterpolants, 0 QuantifiedInterpolants, 9677250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 117 InterpolantComputations, 11 PerfectInterpolantSequences, 1084/5288 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: 1291]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p14_old ; [L80] char p14_new ; [L81] _Bool ep14 ; [L83] char p21_old ; [L84] char p21_new ; [L85] _Bool ep21 ; [L87] char p23_old ; [L88] char p23_new ; [L89] _Bool ep23 ; [L91] char p24_old ; [L92] char p24_new ; [L93] _Bool ep24 ; [L95] char p31_old ; [L96] char p31_new ; [L97] _Bool ep31 ; [L99] char p32_old ; [L100] char p32_new ; [L101] _Bool ep32 ; [L103] char p34_old ; [L104] char p34_new ; [L105] _Bool ep34 ; [L107] char p41_old ; [L108] char p41_new ; [L109] _Bool ep41 ; [L111] char p42_old ; [L112] char p42_new ; [L113] _Bool ep42 ; [L115] char p43_old ; [L116] char p43_new ; [L117] _Bool ep43 ; [L118] char id1 ; [L119] char r1 ; [L120] char st1 ; [L121] char nl1 ; [L122] char m1 ; [L123] char max1 ; [L124] _Bool mode1 ; [L125] char id2 ; [L126] char r2 ; [L127] char st2 ; [L128] char nl2 ; [L129] char m2 ; [L130] char max2 ; [L131] _Bool mode2 ; [L132] char id3 ; [L133] char r3 ; [L134] char st3 ; [L135] char nl3 ; [L136] char m3 ; [L137] char max3 ; [L138] _Bool mode3 ; [L139] char id4 ; [L140] char r4 ; [L141] char st4 ; [L142] char nl4 ; [L143] char m4 ; [L144] char max4 ; [L145] _Bool mode4 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p14 ; [L82] port_t p21 ; [L86] port_t p23 ; [L90] port_t p24 ; [L94] port_t p31 ; [L98] port_t p32 ; [L102] port_t p34 ; [L106] port_t p41 ; [L110] port_t p42 ; [L114] port_t p43 ; [L358] void (*nodes[4])(void) = { & node1, & node2, & node3, & node4}; [L1174] int c1 ; [L1175] int i2 ; [L1178] c1 = 0 [L1179] ep12 = __VERIFIER_nondet_bool() [L1180] ep13 = __VERIFIER_nondet_bool() [L1181] ep14 = __VERIFIER_nondet_bool() [L1182] ep21 = __VERIFIER_nondet_bool() [L1183] ep23 = __VERIFIER_nondet_bool() [L1184] ep24 = __VERIFIER_nondet_bool() [L1185] ep31 = __VERIFIER_nondet_bool() [L1186] ep32 = __VERIFIER_nondet_bool() [L1187] ep34 = __VERIFIER_nondet_bool() [L1188] ep41 = __VERIFIER_nondet_bool() [L1189] ep42 = __VERIFIER_nondet_bool() [L1190] ep43 = __VERIFIER_nondet_bool() [L1191] id1 = __VERIFIER_nondet_char() [L1192] r1 = __VERIFIER_nondet_char() [L1193] st1 = __VERIFIER_nondet_char() [L1194] nl1 = __VERIFIER_nondet_char() [L1195] m1 = __VERIFIER_nondet_char() [L1196] max1 = __VERIFIER_nondet_char() [L1197] mode1 = __VERIFIER_nondet_bool() [L1198] id2 = __VERIFIER_nondet_char() [L1199] r2 = __VERIFIER_nondet_char() [L1200] st2 = __VERIFIER_nondet_char() [L1201] nl2 = __VERIFIER_nondet_char() [L1202] m2 = __VERIFIER_nondet_char() [L1203] max2 = __VERIFIER_nondet_char() [L1204] mode2 = __VERIFIER_nondet_bool() [L1205] id3 = __VERIFIER_nondet_char() [L1206] r3 = __VERIFIER_nondet_char() [L1207] st3 = __VERIFIER_nondet_char() [L1208] nl3 = __VERIFIER_nondet_char() [L1209] m3 = __VERIFIER_nondet_char() [L1210] max3 = __VERIFIER_nondet_char() [L1211] mode3 = __VERIFIER_nondet_bool() [L1212] id4 = __VERIFIER_nondet_char() [L1213] r4 = __VERIFIER_nondet_char() [L1214] st4 = __VERIFIER_nondet_char() [L1215] nl4 = __VERIFIER_nondet_char() [L1216] m4 = __VERIFIER_nondet_char() [L1217] max4 = __VERIFIER_nondet_char() [L1218] mode4 = __VERIFIER_nondet_bool() [L1219] CALL, EXPR init() [L361] _Bool r121 ; [L362] _Bool r131 ; [L363] _Bool r141 ; [L364] _Bool r211 ; [L365] _Bool r231 ; [L366] _Bool r241 ; [L367] _Bool r311 ; [L368] _Bool r321 ; [L369] _Bool r341 ; [L370] _Bool r411 ; [L371] _Bool r421 ; [L372] _Bool r431 ; [L373] _Bool r122 ; [L374] int tmp ; [L375] _Bool r132 ; [L376] int tmp___0 ; [L377] _Bool r142 ; [L378] int tmp___1 ; [L379] _Bool r212 ; [L380] int tmp___2 ; [L381] _Bool r232 ; [L382] int tmp___3 ; [L383] _Bool r242 ; [L384] int tmp___4 ; [L385] _Bool r312 ; [L386] int tmp___5 ; [L387] _Bool r322 ; [L388] int tmp___6 ; [L389] _Bool r342 ; [L390] int tmp___7 ; [L391] _Bool r412 ; [L392] int tmp___8 ; [L393] _Bool r422 ; [L394] int tmp___9 ; [L395] _Bool r432 ; [L396] int tmp___10 ; [L397] _Bool r123 ; [L398] int tmp___11 ; [L399] _Bool r133 ; [L400] int tmp___12 ; [L401] _Bool r143 ; [L402] int tmp___13 ; [L403] _Bool r213 ; [L404] int tmp___14 ; [L405] _Bool r233 ; [L406] int tmp___15 ; [L407] _Bool r243 ; [L408] int tmp___16 ; [L409] _Bool r313 ; [L410] int tmp___17 ; [L411] _Bool r323 ; [L412] int tmp___18 ; [L413] _Bool r343 ; [L414] int tmp___19 ; [L415] _Bool r413 ; [L416] int tmp___20 ; [L417] _Bool r423 ; [L418] int tmp___21 ; [L419] _Bool r433 ; [L420] int tmp___22 ; [L421] int tmp___23 ; [L424] r121 = ep12 [L425] r131 = ep13 [L426] r141 = ep14 [L427] r211 = ep21 [L428] r231 = ep23 [L429] r241 = ep24 [L430] r311 = ep31 [L431] r321 = ep32 [L432] r341 = ep34 [L433] r411 = ep41 [L434] r421 = ep42 [L435] r431 = ep43 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L436] COND TRUE \read(r121) [L437] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L456] r122 = (_Bool )tmp VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L457] COND TRUE \read(r131) [L458] tmp___0 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L477] r132 = (_Bool )tmp___0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L478] COND TRUE \read(r141) [L479] tmp___1 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L498] r142 = (_Bool )tmp___1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L499] COND TRUE \read(r211) [L500] tmp___2 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L519] r212 = (_Bool )tmp___2 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L520] COND TRUE \read(r231) [L521] tmp___3 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L540] r232 = (_Bool )tmp___3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L541] COND TRUE \read(r241) [L542] tmp___4 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L561] r242 = (_Bool )tmp___4 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L562] COND TRUE \read(r311) [L563] tmp___5 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L582] r312 = (_Bool )tmp___5 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L583] COND TRUE \read(r321) [L584] tmp___6 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L603] r322 = (_Bool )tmp___6 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L604] COND TRUE \read(r341) [L605] tmp___7 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L624] r342 = (_Bool )tmp___7 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L625] COND TRUE \read(r411) [L626] tmp___8 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L645] r412 = (_Bool )tmp___8 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L646] COND TRUE \read(r421) [L647] tmp___9 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L666] r422 = (_Bool )tmp___9 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L667] COND TRUE \read(r431) [L668] tmp___10 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L687] r432 = (_Bool )tmp___10 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L688] COND TRUE \read(r122) [L689] tmp___11 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L708] r123 = (_Bool )tmp___11 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L709] COND TRUE \read(r132) [L710] tmp___12 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L729] r133 = (_Bool )tmp___12 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L730] COND TRUE \read(r142) [L731] tmp___13 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L750] r143 = (_Bool )tmp___13 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L751] COND TRUE \read(r212) [L752] tmp___14 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L771] r213 = (_Bool )tmp___14 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L772] COND TRUE \read(r232) [L773] tmp___15 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L792] r233 = (_Bool )tmp___15 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L793] COND TRUE \read(r242) [L794] tmp___16 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L813] r243 = (_Bool )tmp___16 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L814] COND TRUE \read(r312) [L815] tmp___17 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L834] r313 = (_Bool )tmp___17 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L835] COND TRUE \read(r322) [L836] tmp___18 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L855] r323 = (_Bool )tmp___18 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L856] COND TRUE \read(r342) [L857] tmp___19 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L876] r343 = (_Bool )tmp___19 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L877] COND TRUE \read(r412) [L878] tmp___20 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L897] r413 = (_Bool )tmp___20 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L898] COND TRUE \read(r422) [L899] tmp___21 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L918] r423 = (_Bool )tmp___21 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L919] COND TRUE \read(r432) [L920] tmp___22 = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p14=0, p14_new=0, p14_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p24=0, p24_new=0, p24_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, p34=0, p34_new=0, p34_old=0, p41=0, p41_new=0, p41_old=0, p42=0, p42_new=0, p42_old=0, p43=0, p43_new=0, p43_old=0, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L939] r433 = (_Bool )tmp___22 [L940] COND TRUE (int )id1 != (int )id2 [L941] COND TRUE (int )id1 != (int )id3 [L942] COND TRUE (int )id1 != (int )id4 [L943] COND TRUE (int )id2 != (int )id3 [L944] COND TRUE (int )id2 != (int )id4 [L945] COND TRUE (int )id3 != (int )id4 [L946] COND TRUE (int )id1 >= 0 [L947] COND TRUE (int )id2 >= 0 [L948] COND TRUE (int )id3 >= 0 [L949] COND TRUE (int )id4 >= 0 [L950] COND TRUE (int )r1 == 0 [L951] COND TRUE (int )r2 == 0 [L952] COND TRUE (int )r3 == 0 [L953] COND TRUE (int )r4 == 0 [L954] COND TRUE \read(r123) [L955] COND TRUE \read(r133) [L956] COND TRUE \read(r143) [L957] COND TRUE \read(r213) [L958] COND TRUE \read(r233) [L959] COND TRUE \read(r243) [L960] COND TRUE \read(r313) [L961] COND TRUE \read(r323) [L962] COND TRUE \read(r343) [L963] COND TRUE \read(r413) [L964] COND TRUE \read(r423) [L965] COND TRUE \read(r433) [L966] COND TRUE (int )max1 == (int )id1 [L967] COND TRUE (int )max2 == (int )id2 [L968] COND TRUE (int )max3 == (int )id3 [L969] COND TRUE (int )max4 == (int )id4 [L970] COND TRUE (int )st1 == 0 [L971] COND TRUE (int )st2 == 0 [L972] COND TRUE (int )st3 == 0 [L973] COND TRUE (int )st4 == 0 [L974] COND TRUE (int )nl1 == 0 [L975] COND TRUE (int )nl2 == 0 [L976] COND TRUE (int )nl3 == 0 [L977] COND TRUE (int )nl4 == 0 [L978] COND TRUE (int )mode1 == 0 [L979] COND TRUE (int )mode2 == 0 [L980] COND TRUE (int )mode3 == 0 [L981] COND TRUE (int )mode4 == 0 [L982] tmp___23 = 1 [L1109] RET return (tmp___23); [L1219] EXPR init() [L1219] i2 = init() [L1221] p12_old = nomsg [L1222] p12_new = nomsg [L1223] p13_old = nomsg [L1224] p13_new = nomsg [L1225] p14_old = nomsg [L1226] p14_new = nomsg [L1227] p21_old = nomsg [L1228] p21_new = nomsg [L1229] p23_old = nomsg [L1230] p23_new = nomsg [L1231] p24_old = nomsg [L1232] p24_new = nomsg [L1233] p31_old = nomsg [L1234] p31_new = nomsg [L1235] p32_old = nomsg [L1236] p32_new = nomsg [L1237] p34_old = nomsg [L1238] p34_new = nomsg [L1239] p41_old = nomsg [L1240] p41_new = nomsg [L1241] p42_old = nomsg [L1242] p42_new = nomsg [L1243] p43_old = nomsg [L1244] p43_new = nomsg [L1245] i2 = 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND FALSE !(\read(mode1)) [L183] COND TRUE (int )r1 < 3 [L184] COND TRUE \read(ep12) [L185] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L185] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L187] COND TRUE \read(ep13) [L188] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L188] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L190] COND TRUE \read(ep14) [L191] COND TRUE, EXPR max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L191] p14_new = max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L194] RET mode1 = (_Bool)1 [L1248] node1() [L1249] CALL node2() [L204] COND FALSE !(\read(mode2)) [L236] COND TRUE (int )r2 < 3 [L237] COND TRUE \read(ep21) [L238] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L238] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L240] COND TRUE \read(ep23) [L241] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L241] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L243] COND TRUE \read(ep24) [L244] COND TRUE, EXPR max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L244] p24_new = max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L247] RET mode2 = (_Bool)1 [L1249] node2() [L1250] CALL node3() [L257] COND FALSE !(\read(mode3)) [L289] COND TRUE (int )r3 < 3 [L290] COND TRUE \read(ep31) [L291] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L291] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L293] COND TRUE \read(ep32) [L294] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L294] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L296] COND TRUE \read(ep34) [L297] COND TRUE, EXPR max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L297] p34_new = max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L300] RET mode3 = (_Bool)1 [L1250] node3() [L1251] CALL node4() [L310] COND FALSE !(\read(mode4)) [L342] COND TRUE (int )r4 < 3 [L343] COND TRUE \read(ep41) [L344] COND TRUE, EXPR max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L344] p41_new = max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L346] COND TRUE \read(ep42) [L347] COND TRUE, EXPR max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L347] p42_new = max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L349] COND TRUE \read(ep43) [L350] COND TRUE, EXPR max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L350] p43_new = max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L353] RET mode4 = (_Bool)1 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1117] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1118] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1119] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1120] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1121] COND TRUE (int )st4 + (int )nl4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1122] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1125] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1127] COND TRUE (int )r1 < 3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1132] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1135] COND TRUE (((int )nl1 + (int )nl2) + (int )nl3) + (int )nl4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1137] COND TRUE (int )r1 < 3 [L1138] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1277] assert(c1) [L1278] i2 ++ VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=-2, m2=-128, m3=-128, m4=-128, max1=13, max2=127, max3=14, max4=12, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=13, p13=0, p13_new=-1, p13_old=13, p14=0, p14_new=-1, p14_old=13, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=14, p32=0, p32_new=-1, p32_old=14, p34=0, p34_new=-1, p34_old=14, p41=0, p41_new=-1, p41_old=12, p42=0, p42_new=-1, p42_old=12, p43=0, p43_new=-1, p43_old=12, r1=0, r2=0, r3=0, r4=0, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND TRUE \read(mode1) [L152] r1 = (char )((int )r1 + 1) [L153] COND TRUE \read(ep21) [L154] m1 = p21_old [L155] p21_old = nomsg [L156] COND TRUE (int )m1 > (int )max1 [L157] max1 = m1 [L160] COND TRUE \read(ep31) [L161] m1 = p31_old [L162] p31_old = nomsg [L163] COND FALSE !((int )m1 > (int )max1) [L167] COND TRUE \read(ep41) [L168] m1 = p41_old [L169] p41_old = nomsg [L170] COND FALSE !((int )m1 > (int )max1) [L174] COND FALSE !((int )r1 == 3) [L181] RET mode1 = (_Bool)0 [L1248] node1() [L1249] CALL node2() [L204] COND TRUE \read(mode2) [L205] r2 = (char )((int )r2 + 1) [L206] COND TRUE \read(ep12) [L207] m2 = p12_old [L208] p12_old = nomsg [L209] COND FALSE !((int )m2 > (int )max2) [L213] COND TRUE \read(ep32) [L214] m2 = p32_old [L215] p32_old = nomsg [L216] COND FALSE !((int )m2 > (int )max2) [L220] COND TRUE \read(ep42) [L221] m2 = p42_old [L222] p42_old = nomsg [L223] COND FALSE !((int )m2 > (int )max2) [L227] COND FALSE !((int )r2 == 3) [L234] RET mode2 = (_Bool)0 [L1249] node2() [L1250] CALL node3() [L257] COND TRUE \read(mode3) [L258] r3 = (char )((int )r3 + 1) [L259] COND TRUE \read(ep13) [L260] m3 = p13_old [L261] p13_old = nomsg [L262] COND FALSE !((int )m3 > (int )max3) [L266] COND TRUE \read(ep23) [L267] m3 = p23_old [L268] p23_old = nomsg [L269] COND TRUE (int )m3 > (int )max3 [L270] max3 = m3 [L273] COND TRUE \read(ep43) [L274] m3 = p43_old [L275] p43_old = nomsg [L276] COND FALSE !((int )m3 > (int )max3) [L280] COND FALSE !((int )r3 == 3) [L287] RET mode3 = (_Bool)0 [L1250] node3() [L1251] CALL node4() [L310] COND TRUE \read(mode4) [L311] r4 = (char )((int )r4 + 1) [L312] COND TRUE \read(ep14) [L313] m4 = p14_old [L314] p14_old = nomsg [L315] COND TRUE (int )m4 > (int )max4 [L316] max4 = m4 [L319] COND TRUE \read(ep24) [L320] m4 = p24_old [L321] p24_old = nomsg [L322] COND TRUE (int )m4 > (int )max4 [L323] max4 = m4 [L326] COND TRUE \read(ep34) [L327] m4 = p34_old [L328] p34_old = nomsg [L329] COND FALSE !((int )m4 > (int )max4) [L333] COND FALSE !((int )r4 == 3) [L340] RET mode4 = (_Bool)0 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1117] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1118] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1119] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1120] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1121] COND TRUE (int )st4 + (int )nl4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1122] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1125] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1127] COND TRUE (int )r1 < 3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1132] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1135] COND TRUE (((int )nl1 + (int )nl2) + (int )nl3) + (int )nl4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1137] COND TRUE (int )r1 < 3 [L1138] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1277] assert(c1) [L1278] i2 ++ VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND FALSE !(\read(mode1)) [L183] COND TRUE (int )r1 < 3 [L184] COND TRUE \read(ep12) [L185] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L185] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L187] COND TRUE \read(ep13) [L188] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L188] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L190] COND TRUE \read(ep14) [L191] COND TRUE, EXPR max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L191] p14_new = max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L194] RET mode1 = (_Bool)1 [L1248] node1() [L1249] CALL node2() [L204] COND FALSE !(\read(mode2)) [L236] COND TRUE (int )r2 < 3 [L237] COND TRUE \read(ep21) [L238] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L238] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L240] COND TRUE \read(ep23) [L241] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L241] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L243] COND TRUE \read(ep24) [L244] COND TRUE, EXPR max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L244] p24_new = max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L247] RET mode2 = (_Bool)1 [L1249] node2() [L1250] CALL node3() [L257] COND FALSE !(\read(mode3)) [L289] COND TRUE (int )r3 < 3 [L290] COND TRUE \read(ep31) [L291] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L291] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L293] COND TRUE \read(ep32) [L294] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L294] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L296] COND TRUE \read(ep34) [L297] COND TRUE, EXPR max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L297] p34_new = max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L300] RET mode3 = (_Bool)1 [L1250] node3() [L1251] CALL node4() [L310] COND FALSE !(\read(mode4)) [L342] COND TRUE (int )r4 < 3 [L343] COND TRUE \read(ep41) [L344] COND TRUE, EXPR max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L344] p41_new = max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L346] COND TRUE \read(ep42) [L347] COND TRUE, EXPR max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L347] p42_new = max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L349] COND TRUE \read(ep43) [L350] COND TRUE, EXPR max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L350] p43_new = max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L353] RET mode4 = (_Bool)1 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1117] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1118] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1119] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1120] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1121] COND TRUE (int )st4 + (int )nl4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1122] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1125] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1127] COND TRUE (int )r1 < 3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1132] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1135] COND TRUE (((int )nl1 + (int )nl2) + (int )nl3) + (int )nl4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1137] COND TRUE (int )r1 < 3 [L1138] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1277] assert(c1) [L1278] i2 ++ VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=12, m2=12, m3=12, m4=14, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=1, r2=1, r3=1, r4=1, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND TRUE \read(mode1) [L152] r1 = (char )((int )r1 + 1) [L153] COND TRUE \read(ep21) [L154] m1 = p21_old [L155] p21_old = nomsg [L156] COND FALSE !((int )m1 > (int )max1) [L160] COND TRUE \read(ep31) [L161] m1 = p31_old [L162] p31_old = nomsg [L163] COND FALSE !((int )m1 > (int )max1) [L167] COND TRUE \read(ep41) [L168] m1 = p41_old [L169] p41_old = nomsg [L170] COND FALSE !((int )m1 > (int )max1) [L174] COND FALSE !((int )r1 == 3) [L181] RET mode1 = (_Bool)0 [L1248] node1() [L1249] CALL node2() [L204] COND TRUE \read(mode2) [L205] r2 = (char )((int )r2 + 1) [L206] COND TRUE \read(ep12) [L207] m2 = p12_old [L208] p12_old = nomsg [L209] COND FALSE !((int )m2 > (int )max2) [L213] COND TRUE \read(ep32) [L214] m2 = p32_old [L215] p32_old = nomsg [L216] COND FALSE !((int )m2 > (int )max2) [L220] COND TRUE \read(ep42) [L221] m2 = p42_old [L222] p42_old = nomsg [L223] COND FALSE !((int )m2 > (int )max2) [L227] COND FALSE !((int )r2 == 3) [L234] RET mode2 = (_Bool)0 [L1249] node2() [L1250] CALL node3() [L257] COND TRUE \read(mode3) [L258] r3 = (char )((int )r3 + 1) [L259] COND TRUE \read(ep13) [L260] m3 = p13_old [L261] p13_old = nomsg [L262] COND FALSE !((int )m3 > (int )max3) [L266] COND TRUE \read(ep23) [L267] m3 = p23_old [L268] p23_old = nomsg [L269] COND FALSE !((int )m3 > (int )max3) [L273] COND TRUE \read(ep43) [L274] m3 = p43_old [L275] p43_old = nomsg [L276] COND FALSE !((int )m3 > (int )max3) [L280] COND FALSE !((int )r3 == 3) [L287] RET mode3 = (_Bool)0 [L1250] node3() [L1251] CALL node4() [L310] COND TRUE \read(mode4) [L311] r4 = (char )((int )r4 + 1) [L312] COND TRUE \read(ep14) [L313] m4 = p14_old [L314] p14_old = nomsg [L315] COND FALSE !((int )m4 > (int )max4) [L319] COND TRUE \read(ep24) [L320] m4 = p24_old [L321] p24_old = nomsg [L322] COND FALSE !((int )m4 > (int )max4) [L326] COND TRUE \read(ep34) [L327] m4 = p34_old [L328] p34_old = nomsg [L329] COND FALSE !((int )m4 > (int )max4) [L333] COND FALSE !((int )r4 == 3) [L340] RET mode4 = (_Bool)0 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1117] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1118] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1119] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1120] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1121] COND TRUE (int )st4 + (int )nl4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1122] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1125] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1127] COND TRUE (int )r1 < 3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1132] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1135] COND TRUE (((int )nl1 + (int )nl2) + (int )nl3) + (int )nl4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1137] COND TRUE (int )r1 < 3 [L1138] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1277] assert(c1) [L1278] i2 ++ VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND FALSE !(\read(mode1)) [L183] COND TRUE (int )r1 < 3 [L184] COND TRUE \read(ep12) [L185] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L185] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L187] COND TRUE \read(ep13) [L188] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L188] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L190] COND TRUE \read(ep14) [L191] COND TRUE, EXPR max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L191] p14_new = max1 != nomsg && p14_new == nomsg ? max1 : p14_new [L194] RET mode1 = (_Bool)1 [L1248] node1() [L1249] CALL node2() [L204] COND FALSE !(\read(mode2)) [L236] COND TRUE (int )r2 < 3 [L237] COND TRUE \read(ep21) [L238] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L238] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L240] COND TRUE \read(ep23) [L241] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L241] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L243] COND TRUE \read(ep24) [L244] COND TRUE, EXPR max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L244] p24_new = max2 != nomsg && p24_new == nomsg ? max2 : p24_new [L247] RET mode2 = (_Bool)1 [L1249] node2() [L1250] CALL node3() [L257] COND FALSE !(\read(mode3)) [L289] COND TRUE (int )r3 < 3 [L290] COND TRUE \read(ep31) [L291] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L291] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L293] COND TRUE \read(ep32) [L294] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L294] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L296] COND TRUE \read(ep34) [L297] COND TRUE, EXPR max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L297] p34_new = max3 != nomsg && p34_new == nomsg ? max3 : p34_new [L300] RET mode3 = (_Bool)1 [L1250] node3() [L1251] CALL node4() [L310] COND FALSE !(\read(mode4)) [L342] COND TRUE (int )r4 < 3 [L343] COND TRUE \read(ep41) [L344] COND TRUE, EXPR max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L344] p41_new = max4 != nomsg && p41_new == nomsg ? max4 : p41_new [L346] COND TRUE \read(ep42) [L347] COND TRUE, EXPR max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L347] p42_new = max4 != nomsg && p42_new == nomsg ? max4 : p42_new [L349] COND TRUE \read(ep43) [L350] COND TRUE, EXPR max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L350] p43_new = max4 != nomsg && p43_new == nomsg ? max4 : p43_new [L353] RET mode4 = (_Bool)1 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1117] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1118] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1119] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1120] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1121] COND TRUE (int )st4 + (int )nl4 <= 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1122] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1125] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1127] COND TRUE (int )r1 < 3 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1132] COND FALSE !((int )r1 >= 3) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1135] COND TRUE (((int )nl1 + (int )nl2) + (int )nl3) + (int )nl4 == 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1137] COND TRUE (int )r1 < 3 [L1138] tmp = 1 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1277] assert(c1) [L1278] i2 ++ VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=1, mode2=1, mode3=1, mode4=1, nl1=0, nl2=0, nl3=0, nl4=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=127, p14=0, p14_new=-1, p14_old=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p24=0, p24_new=-1, p24_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, p34=0, p34_new=-1, p34_old=127, p41=0, p41_new=-1, p41_old=127, p42=0, p42_new=-1, p42_old=127, p43=0, p43_new=-1, p43_old=127, r1=2, r2=2, r3=2, r4=2, st1=0, st2=0, st3=0, st4=0] [L1246] COND TRUE i2 < 8 [L1248] CALL node1() [L151] COND TRUE \read(mode1) [L152] r1 = (char )((int )r1 + 1) [L153] COND TRUE \read(ep21) [L154] m1 = p21_old [L155] p21_old = nomsg [L156] COND FALSE !((int )m1 > (int )max1) [L160] COND TRUE \read(ep31) [L161] m1 = p31_old [L162] p31_old = nomsg [L163] COND FALSE !((int )m1 > (int )max1) [L167] COND TRUE \read(ep41) [L168] m1 = p41_old [L169] p41_old = nomsg [L170] COND FALSE !((int )m1 > (int )max1) [L174] COND TRUE (int )r1 == 3 [L175] COND FALSE !((int )max1 == (int )id1) [L178] st1 = (char)1 [L181] RET mode1 = (_Bool)0 [L1248] node1() [L1249] CALL node2() [L204] COND TRUE \read(mode2) [L205] r2 = (char )((int )r2 + 1) [L206] COND TRUE \read(ep12) [L207] m2 = p12_old [L208] p12_old = nomsg [L209] COND FALSE !((int )m2 > (int )max2) [L213] COND TRUE \read(ep32) [L214] m2 = p32_old [L215] p32_old = nomsg [L216] COND FALSE !((int )m2 > (int )max2) [L220] COND TRUE \read(ep42) [L221] m2 = p42_old [L222] p42_old = nomsg [L223] COND FALSE !((int )m2 > (int )max2) [L227] COND TRUE (int )r2 == 3 [L228] COND TRUE (int )max2 == (int )id2 [L229] st2 = (char)1 [L234] RET mode2 = (_Bool)0 [L1249] node2() [L1250] CALL node3() [L257] COND TRUE \read(mode3) [L258] r3 = (char )((int )r3 + 1) [L259] COND TRUE \read(ep13) [L260] m3 = p13_old [L261] p13_old = nomsg [L262] COND FALSE !((int )m3 > (int )max3) [L266] COND TRUE \read(ep23) [L267] m3 = p23_old [L268] p23_old = nomsg [L269] COND FALSE !((int )m3 > (int )max3) [L273] COND TRUE \read(ep43) [L274] m3 = p43_old [L275] p43_old = nomsg [L276] COND FALSE !((int )m3 > (int )max3) [L280] COND TRUE (int )r3 == 3 [L281] COND FALSE !((int )max3 == (int )id3) [L284] nl3 = (char)1 [L287] RET mode3 = (_Bool)0 [L1250] node3() [L1251] CALL node4() [L310] COND TRUE \read(mode4) [L311] r4 = (char )((int )r4 + 1) [L312] COND TRUE \read(ep14) [L313] m4 = p14_old [L314] p14_old = nomsg [L315] COND FALSE !((int )m4 > (int )max4) [L319] COND TRUE \read(ep24) [L320] m4 = p24_old [L321] p24_old = nomsg [L322] COND FALSE !((int )m4 > (int )max4) [L326] COND TRUE \read(ep34) [L327] m4 = p34_old [L328] p34_old = nomsg [L329] COND FALSE !((int )m4 > (int )max4) [L333] COND TRUE (int )r4 == 3 [L334] COND FALSE !((int )max4 == (int )id4) [L337] nl4 = (char)1 [L340] RET mode4 = (_Bool)0 [L1251] node4() [L1252] p12_old = p12_new [L1253] p12_new = nomsg [L1254] p13_old = p13_new [L1255] p13_new = nomsg [L1256] p14_old = p14_new [L1257] p14_new = nomsg [L1258] p21_old = p21_new [L1259] p21_new = nomsg [L1260] p23_old = p23_new [L1261] p23_new = nomsg [L1262] p24_old = p24_new [L1263] p24_new = nomsg [L1264] p31_old = p31_new [L1265] p31_new = nomsg [L1266] p32_old = p32_new [L1267] p32_new = nomsg [L1268] p34_old = p34_new [L1269] p34_new = nomsg [L1270] p41_old = p41_new [L1271] p41_new = nomsg [L1272] p42_old = p42_new [L1273] p42_new = nomsg [L1274] p43_old = p43_new [L1275] p43_new = nomsg [L1276] CALL, EXPR check() [L1114] int tmp ; VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=1, nl4=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=3, r2=3, r3=3, r4=3, st1=1, st2=1, st3=0, st4=0] [L1117] COND FALSE !((((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1) [L1167] tmp = 0 VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=1, nl4=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=3, r2=3, r3=3, r4=3, st1=1, st2=1, st3=0, st4=0] [L1169] RET return (tmp); [L1276] EXPR check() [L1276] c1 = check() [L1277] CALL assert(c1) [L1289] COND TRUE ! arg VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=1, nl4=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=3, r2=3, r3=3, r4=3, st1=1, st2=1, st3=0, st4=0] [L1291] __VERIFIER_error() VAL [ep12=1, ep13=1, ep14=1, ep21=1, ep23=1, ep24=1, ep31=1, ep32=1, ep34=1, ep41=1, ep42=1, ep43=1, id1=13, id2=127, id3=14, id4=12, m1=127, m2=127, m3=127, m4=127, max1=127, max2=127, max3=127, max4=127, mode1=0, mode2=0, mode3=0, mode4=0, nl1=0, nl2=0, nl3=1, nl4=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p14=0, p14_new=-1, p14_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p24=0, p24_new=-1, p24_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, p34=0, p34_new=-1, p34_old=-1, p41=0, p41_new=-1, p41_old=-1, p42=0, p42_new=-1, p42_old=-1, p43=0, p43_new=-1, p43_old=-1, r1=3, r2=3, r3=3, r4=3, st1=1, st2=1, st3=0, st4=0] * 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 444.82 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 931.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 155.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.46 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6680.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 264.5 MB. Max. memory is 11.5 GB. * CodeCheck took 692685.59 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 676.9 MB in the end (delta: 407.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 277.79 ms. Allocated memory is still 4.8 GB. Free memory was 676.9 MB in the beginning and 604.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...