./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9ac322b8286f0075601fe20d9ff9aa0453c0fa1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 05:33:57,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 05:33:57,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 05:33:57,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 05:33:57,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 05:33:57,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 05:33:57,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 05:33:57,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 05:33:57,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 05:33:57,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 05:33:57,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 05:33:57,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 05:33:57,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 05:33:57,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 05:33:57,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 05:33:57,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 05:33:57,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 05:33:57,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 05:33:57,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 05:33:57,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 05:33:57,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 05:33:57,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 05:33:57,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 05:33:57,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 05:33:57,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 05:33:57,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 05:33:57,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 05:33:57,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 05:33:57,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 05:33:57,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 05:33:57,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 05:33:57,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 05:33:57,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 05:33:57,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 05:33:57,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 05:33:57,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 05:33:57,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 05:33:57,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 05:33:57,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 05:33:57,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 05:33:57,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 05:33:57,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 05:33:57,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 05:33:57,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 05:33:57,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 05:33:57,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 05:33:57,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 05:33:57,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 05:33:57,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 05:33:57,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 05:33:57,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 05:33:57,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 05:33:57,257 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 05:33:57,257 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 05:33:57,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 05:33:57,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 05:33:57,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 05:33:57,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 05:33:57,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 05:33:57,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 05:33:57,258 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 05:33:57,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 05:33:57,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 05:33:57,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9ac322b8286f0075601fe20d9ff9aa0453c0fa1 [2019-12-02 05:33:57,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 05:33:57,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 05:33:57,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 05:33:57,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 05:33:57,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 05:33:57,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-02 05:33:57,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/data/c80d55654/d483a992598d4d359b0058430773d0a0/FLAG42b416bf6 [2019-12-02 05:33:57,804 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 05:33:57,804 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-02 05:33:57,812 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/data/c80d55654/d483a992598d4d359b0058430773d0a0/FLAG42b416bf6 [2019-12-02 05:33:58,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/data/c80d55654/d483a992598d4d359b0058430773d0a0 [2019-12-02 05:33:58,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 05:33:58,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 05:33:58,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 05:33:58,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 05:33:58,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 05:33:58,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af8bd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58, skipping insertion in model container [2019-12-02 05:33:58,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 05:33:58,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 05:33:58,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:33:58,486 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 05:33:58,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:33:58,592 INFO L208 MainTranslator]: Completed translation [2019-12-02 05:33:58,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58 WrapperNode [2019-12-02 05:33:58,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 05:33:58,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 05:33:58,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 05:33:58,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 05:33:58,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 05:33:58,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 05:33:58,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 05:33:58,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 05:33:58,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... [2019-12-02 05:33:58,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 05:33:58,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 05:33:58,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 05:33:58,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 05:33:58,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/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 [2019-12-02 05:33:58,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 05:33:58,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 05:33:59,948 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 05:33:59,949 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-02 05:33:59,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:33:59 BoogieIcfgContainer [2019-12-02 05:33:59,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 05:33:59,950 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 05:33:59,950 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 05:33:59,957 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 05:33:59,957 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:33:59" (1/1) ... [2019-12-02 05:33:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 05:33:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:33:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 215 states and 378 transitions. [2019-12-02 05:33:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 378 transitions. [2019-12-02 05:33:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-02 05:33:59,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 221 states and 389 transitions. [2019-12-02 05:34:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 389 transitions. [2019-12-02 05:34:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:00,589 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 221 states and 388 transitions. [2019-12-02 05:34:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 388 transitions. [2019-12-02 05:34:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:01,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 227 states and 398 transitions. [2019-12-02 05:34:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 398 transitions. [2019-12-02 05:34:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:02,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 270 states and 483 transitions. [2019-12-02 05:34:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 483 transitions. [2019-12-02 05:34:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:02,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 269 states and 481 transitions. [2019-12-02 05:34:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 481 transitions. [2019-12-02 05:34:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:02,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 312 states and 566 transitions. [2019-12-02 05:34:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 566 transitions. [2019-12-02 05:34:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:02,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 311 states and 562 transitions. [2019-12-02 05:34:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 562 transitions. [2019-12-02 05:34:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:02,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 324 states and 586 transitions. [2019-12-02 05:34:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 586 transitions. [2019-12-02 05:34:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 05:34:05,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 326 states and 590 transitions. [2019-12-02 05:34:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 590 transitions. [2019-12-02 05:34:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 05:34:05,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 323 states and 584 transitions. [2019-12-02 05:34:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 584 transitions. [2019-12-02 05:34:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 05:34:06,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 326 states and 589 transitions. [2019-12-02 05:34:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 589 transitions. [2019-12-02 05:34:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:07,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 323 states and 582 transitions. [2019-12-02 05:34:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 582 transitions. [2019-12-02 05:34:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:08,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 323 states and 581 transitions. [2019-12-02 05:34:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 581 transitions. [2019-12-02 05:34:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:09,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 326 states and 586 transitions. [2019-12-02 05:34:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 586 transitions. [2019-12-02 05:34:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:09,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 327 states and 586 transitions. [2019-12-02 05:34:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 586 transitions. [2019-12-02 05:34:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:09,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 330 states and 591 transitions. [2019-12-02 05:34:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 591 transitions. [2019-12-02 05:34:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:09,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 331 states and 591 transitions. [2019-12-02 05:34:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 591 transitions. [2019-12-02 05:34:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:09,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 376 states and 679 transitions. [2019-12-02 05:34:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 679 transitions. [2019-12-02 05:34:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:10,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 428 states and 785 transitions. [2019-12-02 05:34:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 785 transitions. [2019-12-02 05:34:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:17,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 440 states and 803 transitions. [2019-12-02 05:34:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 803 transitions. [2019-12-02 05:34:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 443 states and 808 transitions. [2019-12-02 05:34:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 808 transitions. [2019-12-02 05:34:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 444 states and 808 transitions. [2019-12-02 05:34:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 808 transitions. [2019-12-02 05:34:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 447 states and 813 transitions. [2019-12-02 05:34:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 813 transitions. [2019-12-02 05:34:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 448 states and 813 transitions. [2019-12-02 05:34:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 813 transitions. [2019-12-02 05:34:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,506 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 451 states and 818 transitions. [2019-12-02 05:34:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 818 transitions. [2019-12-02 05:34:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:18,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 452 states and 820 transitions. [2019-12-02 05:34:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 820 transitions. [2019-12-02 05:34:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:19,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 495 states and 903 transitions. [2019-12-02 05:34:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 903 transitions. [2019-12-02 05:34:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-02 05:34:20,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 494 states and 901 transitions. [2019-12-02 05:34:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 901 transitions. [2019-12-02 05:34:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 05:34:21,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 492 states and 896 transitions. [2019-12-02 05:34:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 896 transitions. [2019-12-02 05:34:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 05:34:22,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 474 states and 866 transitions. [2019-12-02 05:34:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 866 transitions. [2019-12-02 05:34:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 05:34:23,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 482 states and 881 transitions. [2019-12-02 05:34:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 881 transitions. [2019-12-02 05:34:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 05:34:27,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 489 states and 897 transitions. [2019-12-02 05:34:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 897 transitions. [2019-12-02 05:34:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:32,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 516 states and 944 transitions. [2019-12-02 05:34:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 944 transitions. [2019-12-02 05:34:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:41,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 523 states and 955 transitions. [2019-12-02 05:34:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 955 transitions. [2019-12-02 05:34:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:42,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 523 states and 954 transitions. [2019-12-02 05:34:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 954 transitions. [2019-12-02 05:34:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:43,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 565 states and 1042 transitions. [2019-12-02 05:34:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1042 transitions. [2019-12-02 05:34:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:47,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 582 states and 1075 transitions. [2019-12-02 05:34:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1075 transitions. [2019-12-02 05:34:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:48,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 605 states and 1117 transitions. [2019-12-02 05:34:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1117 transitions. [2019-12-02 05:34:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:49,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 608 states and 1122 transitions. [2019-12-02 05:34:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1122 transitions. [2019-12-02 05:34:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:49,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 625 states and 1155 transitions. [2019-12-02 05:34:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1155 transitions. [2019-12-02 05:34:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:51,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 627 states and 1156 transitions. [2019-12-02 05:34:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1156 transitions. [2019-12-02 05:34:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:51,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 626 states and 1152 transitions. [2019-12-02 05:34:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1152 transitions. [2019-12-02 05:34:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:51,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 629 states and 1157 transitions. [2019-12-02 05:34:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1157 transitions. [2019-12-02 05:34:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:51,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 630 states and 1157 transitions. [2019-12-02 05:34:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1157 transitions. [2019-12-02 05:34:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:51,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 633 states and 1161 transitions. [2019-12-02 05:34:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1161 transitions. [2019-12-02 05:34:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:54,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 634 states and 1165 transitions. [2019-12-02 05:34:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1165 transitions. [2019-12-02 05:34:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:55,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:34:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:34:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:34:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 642 states and 1179 transitions. [2019-12-02 05:34:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1179 transitions. [2019-12-02 05:34:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:34:59,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:34:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:35:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:35:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:35:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 657 states and 1213 transitions. [2019-12-02 05:35:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1213 transitions. [2019-12-02 05:35:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:35:21,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:35:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:35:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:35:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:35:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 658 states and 1216 transitions. [2019-12-02 05:35:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1216 transitions. [2019-12-02 05:35:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:35:22,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:35:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:35:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:35:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:35:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 659 states and 1217 transitions. [2019-12-02 05:35:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1217 transitions. [2019-12-02 05:35:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:35:22,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:35:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:35:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:35:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:35:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 662 states and 1221 transitions. [2019-12-02 05:35:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1221 transitions. [2019-12-02 05:35:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:35:23,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:35:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:35:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:35:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:35:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 719 states and 1332 transitions. [2019-12-02 05:35:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1332 transitions. [2019-12-02 05:35:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:35:59,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:35:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:04,472 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-02 05:36:06,000 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-02 05:36:06,600 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-12-02 05:36:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 732 states and 1352 transitions. [2019-12-02 05:36:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1352 transitions. [2019-12-02 05:36:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:36:20,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 736 states and 1360 transitions. [2019-12-02 05:36:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1360 transitions. [2019-12-02 05:36:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-02 05:36:22,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 740 states and 1366 transitions. [2019-12-02 05:36:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1366 transitions. [2019-12-02 05:36:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:23,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 747 states and 1379 transitions. [2019-12-02 05:36:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1379 transitions. [2019-12-02 05:36:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:36,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 751 states and 1387 transitions. [2019-12-02 05:36:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1387 transitions. [2019-12-02 05:36:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:45,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 751 states and 1386 transitions. [2019-12-02 05:36:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1386 transitions. [2019-12-02 05:36:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:47,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 751 states and 1385 transitions. [2019-12-02 05:36:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1385 transitions. [2019-12-02 05:36:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:49,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:36:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:36:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 757 states and 1395 transitions. [2019-12-02 05:36:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1395 transitions. [2019-12-02 05:36:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:36:55,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:36:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:36:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:37:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:37:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 764 states and 1410 transitions. [2019-12-02 05:37:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1410 transitions. [2019-12-02 05:37:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:37:02,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:37:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:37:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:37:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:37:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 777 states and 1432 transitions. [2019-12-02 05:37:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1432 transitions. [2019-12-02 05:37:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:37:16,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:37:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:37:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:37:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:37:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 785 states and 1452 transitions. [2019-12-02 05:37:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1452 transitions. [2019-12-02 05:37:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:37:29,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:37:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:37:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:37:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:37:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 802 states and 1482 transitions. [2019-12-02 05:37:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1482 transitions. [2019-12-02 05:37:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-02 05:37:48,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:37:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:37:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:37:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:37:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 806 states and 1490 transitions. [2019-12-02 05:37:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1490 transitions. [2019-12-02 05:37:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:37:50,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:37:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:37:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:38:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:38:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 818 states and 1513 transitions. [2019-12-02 05:38:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1513 transitions. [2019-12-02 05:38:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:38:44,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:38:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:38:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:38:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:38:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 821 states and 1521 transitions. [2019-12-02 05:38:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1521 transitions. [2019-12-02 05:38:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:38:51,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:38:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:38:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:39:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:39:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 825 states and 1528 transitions. [2019-12-02 05:39:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1528 transitions. [2019-12-02 05:39:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:39:49,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:39:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:39:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:39:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:39:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 829 states and 1534 transitions. [2019-12-02 05:39:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1534 transitions. [2019-12-02 05:39:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:39:51,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:39:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:39:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:39:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:39:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 812 states and 1494 transitions. [2019-12-02 05:39:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1494 transitions. [2019-12-02 05:39:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:39:57,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:39:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:39:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 812 states and 1492 transitions. [2019-12-02 05:40:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1492 transitions. [2019-12-02 05:40:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:06,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 790 states and 1444 transitions. [2019-12-02 05:40:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1444 transitions. [2019-12-02 05:40:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:23,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 786 states and 1436 transitions. [2019-12-02 05:40:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1436 transitions. [2019-12-02 05:40:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:35,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 786 states and 1435 transitions. [2019-12-02 05:40:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1435 transitions. [2019-12-02 05:40:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:38,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 784 states and 1430 transitions. [2019-12-02 05:40:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1430 transitions. [2019-12-02 05:40:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:40,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 773 states and 1413 transitions. [2019-12-02 05:40:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1413 transitions. [2019-12-02 05:40:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:45,202 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 776 states and 1420 transitions. [2019-12-02 05:40:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1420 transitions. [2019-12-02 05:40:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:45,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 779 states and 1429 transitions. [2019-12-02 05:40:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1429 transitions. [2019-12-02 05:40:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:51,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 780 states and 1430 transitions. [2019-12-02 05:40:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1430 transitions. [2019-12-02 05:40:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:53,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:40:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:40:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 781 states and 1431 transitions. [2019-12-02 05:40:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1431 transitions. [2019-12-02 05:40:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:40:56,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:40:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:40:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 832 states and 1534 transitions. [2019-12-02 05:41:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1534 transitions. [2019-12-02 05:41:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:26,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 841 states and 1552 transitions. [2019-12-02 05:41:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1552 transitions. [2019-12-02 05:41:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:38,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 858 states and 1585 transitions. [2019-12-02 05:41:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1585 transitions. [2019-12-02 05:41:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:43,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 861 states and 1589 transitions. [2019-12-02 05:41:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1589 transitions. [2019-12-02 05:41:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:44,878 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 864 states and 1594 transitions. [2019-12-02 05:41:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1594 transitions. [2019-12-02 05:41:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:44,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 865 states and 1597 transitions. [2019-12-02 05:41:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1597 transitions. [2019-12-02 05:41:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:44,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:41:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:41:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 866 states and 1597 transitions. [2019-12-02 05:41:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1597 transitions. [2019-12-02 05:41:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:41:46,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:41:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:41:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 878 states and 1620 transitions. [2019-12-02 05:42:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1620 transitions. [2019-12-02 05:42:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:05,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 879 states and 1620 transitions. [2019-12-02 05:42:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2019-12-02 05:42:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:07,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 925 states and 1710 transitions. [2019-12-02 05:42:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1710 transitions. [2019-12-02 05:42:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:28,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 927 states and 1716 transitions. [2019-12-02 05:42:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1716 transitions. [2019-12-02 05:42:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:36,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 970 states and 1796 transitions. [2019-12-02 05:42:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1796 transitions. [2019-12-02 05:42:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:49,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 970 states and 1795 transitions. [2019-12-02 05:42:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1795 transitions. [2019-12-02 05:42:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:51,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 966 states and 1786 transitions. [2019-12-02 05:42:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1786 transitions. [2019-12-02 05:42:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:52,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1007 states and 1866 transitions. [2019-12-02 05:42:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1866 transitions. [2019-12-02 05:42:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:55,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1008 states and 1867 transitions. [2019-12-02 05:42:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1867 transitions. [2019-12-02 05:42:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:57,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1009 states and 1867 transitions. [2019-12-02 05:42:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1867 transitions. [2019-12-02 05:42:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:57,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:42:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:42:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1008 states and 1864 transitions. [2019-12-02 05:42:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1864 transitions. [2019-12-02 05:42:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:42:57,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:42:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:42:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1053 states and 1951 transitions. [2019-12-02 05:43:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1951 transitions. [2019-12-02 05:43:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:43:03,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1054 states and 1951 transitions. [2019-12-02 05:43:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1951 transitions. [2019-12-02 05:43:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 05:43:03,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1053 states and 1948 transitions. [2019-12-02 05:43:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1948 transitions. [2019-12-02 05:43:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:43:03,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1055 states and 1957 transitions. [2019-12-02 05:43:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1957 transitions. [2019-12-02 05:43:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:43:24,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1053 states and 1952 transitions. [2019-12-02 05:43:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1952 transitions. [2019-12-02 05:43:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:43:26,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1053 states and 1950 transitions. [2019-12-02 05:43:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1950 transitions. [2019-12-02 05:43:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:43:36,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:43:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:43:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1059 states and 1961 transitions. [2019-12-02 05:43:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1961 transitions. [2019-12-02 05:43:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:43:50,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:43:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:43:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1061 states and 1968 transitions. [2019-12-02 05:44:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1968 transitions. [2019-12-02 05:44:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:10,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1051 states and 1945 transitions. [2019-12-02 05:44:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1945 transitions. [2019-12-02 05:44:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:19,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1056 states and 1958 transitions. [2019-12-02 05:44:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1958 transitions. [2019-12-02 05:44:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:35,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1056 states and 1957 transitions. [2019-12-02 05:44:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1957 transitions. [2019-12-02 05:44:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:38,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1060 states and 1963 transitions. [2019-12-02 05:44:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1963 transitions. [2019-12-02 05:44:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:41,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1064 states and 1970 transitions. [2019-12-02 05:44:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1970 transitions. [2019-12-02 05:44:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:43,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1064 states and 1968 transitions. [2019-12-02 05:44:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1968 transitions. [2019-12-02 05:44:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:50,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:44:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:44:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1056 states and 1949 transitions. [2019-12-02 05:44:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1949 transitions. [2019-12-02 05:44:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:44:56,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:44:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:44:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:45:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:45:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 819 states and 1501 transitions. [2019-12-02 05:45:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1501 transitions. [2019-12-02 05:45:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:45:02,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:45:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:45:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:45:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:45:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 826 states and 1510 transitions. [2019-12-02 05:45:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1510 transitions. [2019-12-02 05:45:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:45:11,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:45:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:45:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:45:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:45:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 837 states and 1530 transitions. [2019-12-02 05:45:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1530 transitions. [2019-12-02 05:45:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:45:33,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:45:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:45:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:45:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:45:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 849 states and 1554 transitions. [2019-12-02 05:45:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1554 transitions. [2019-12-02 05:45:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:45:54,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:45:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:45:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:46:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:46:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 853 states and 1561 transitions. [2019-12-02 05:46:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1561 transitions. [2019-12-02 05:46:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 05:46:08,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:46:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:46:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:46:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:46:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 854 states and 1561 transitions. [2019-12-02 05:46:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1561 transitions. [2019-12-02 05:46:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-02 05:46:11,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:46:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:46:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:46:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:46:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:46:11,799 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 120 iterations. [2019-12-02 05:46:11,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 05:46:11 ImpRootNode [2019-12-02 05:46:11,983 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 05:46:11,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 05:46:11,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 05:46:11,983 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 05:46:11,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:33:59" (3/4) ... [2019-12-02 05:46:11,985 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 05:46:12,126 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d997848d-dfe7-47b3-a4e1-5a9a06760118/bin/ukojak/witness.graphml [2019-12-02 05:46:12,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 05:46:12,127 INFO L168 Benchmark]: Toolchain (without parser) took 733970.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 934.0 MB in the beginning and 447.1 MB in the end (delta: 486.9 MB). Peak memory consumption was 560.3 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,128 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:46:12,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -113.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:46:12,129 INFO L168 Benchmark]: Boogie Preprocessor took 33.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,130 INFO L168 Benchmark]: RCFGBuilder took 1273.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.8 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,130 INFO L168 Benchmark]: CodeCheck took 732032.49 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Free memory was 1.0 GB in the beginning and 499.2 MB in the end (delta: 537.8 MB). Peak memory consumption was 540.9 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,130 INFO L168 Benchmark]: Witness Printer took 143.50 ms. Allocated memory is still 1.1 GB. Free memory was 499.2 MB in the beginning and 448.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-02 05:46:12,132 INFO L335 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, 215 locations, 1 error locations. Result: UNSAFE, OverallTime: 731.8s, OverallIterations: 120, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 285407664 SDtfs, -1518549068 SDslu, 573346160 SDs, 0 SdLazy, -970984320 SolverSat, -1442774928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 221.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112780 GetRequests, 109316 SyntacticMatches, 1878 SemanticMatches, 1586 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358048 ImplicationChecksByTransitivity, 718.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 14350 NumberOfCodeBlocks, 14350 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 14106 ConstructedInterpolants, 0 QuantifiedInterpolants, 6679616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 119 InterpolantComputations, 119 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 804]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1709; [L65] int __return_1837; [L66] int __return_1955; [L67] int __return_2060; [L68] int __return_2183; [L69] int __tmp_2184_0; [L70] int __return_2292; [L71] int __return_2197; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_char() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] id2 = __VERIFIER_nondet_char() [L91] r2 = __VERIFIER_nondet_char() [L92] st2 = __VERIFIER_nondet_char() [L93] nl2 = __VERIFIER_nondet_char() [L94] m2 = __VERIFIER_nondet_char() [L95] max2 = __VERIFIER_nondet_char() [L96] mode2 = __VERIFIER_nondet_bool() [L97] id3 = __VERIFIER_nondet_char() [L98] r3 = __VERIFIER_nondet_char() [L99] st3 = __VERIFIER_nondet_char() [L100] nl3 = __VERIFIER_nondet_char() [L101] m3 = __VERIFIER_nondet_char() [L102] max3 = __VERIFIER_nondet_char() [L103] mode3 = __VERIFIER_nondet_bool() [L105] _Bool init__r121; [L106] _Bool init__r131; [L107] _Bool init__r211; [L108] _Bool init__r231; [L109] _Bool init__r311; [L110] _Bool init__r321; [L111] _Bool init__r122; [L112] int init__tmp; [L113] _Bool init__r132; [L114] int init__tmp___0; [L115] _Bool init__r212; [L116] int init__tmp___1; [L117] _Bool init__r232; [L118] int init__tmp___2; [L119] _Bool init__r312; [L120] int init__tmp___3; [L121] _Bool init__r322; [L122] int init__tmp___4; [L123] int init__tmp___5; [L124] init__r121 = ep12 [L125] init__r131 = ep13 [L126] init__r211 = ep21 [L127] init__r231 = ep23 [L128] init__r311 = ep31 [L129] init__r321 = ep32 [L130] COND TRUE !(init__r121 == 0) [L132] init__tmp = 1 [L134] init__r122 = (_Bool)init__tmp [L135] COND FALSE !(!(init__r131 == 0)) [L2183] COND TRUE !(init__r121 == 0) [L2185] COND TRUE !(ep23 == 0) [L2187] init__tmp___0 = 1 [L139] init__r132 = (_Bool)init__tmp___0 [L140] COND FALSE !(!(init__r211 == 0)) [L2160] COND TRUE !(init__r231 == 0) [L2162] COND TRUE !(ep31 == 0) [L2164] init__tmp___1 = 1 [L144] init__r212 = (_Bool)init__tmp___1 [L145] COND TRUE !(init__r231 == 0) [L147] init__tmp___2 = 1 [L149] init__r232 = (_Bool)init__tmp___2 [L150] COND TRUE !(init__r311 == 0) [L152] init__tmp___3 = 1 [L154] init__r312 = (_Bool)init__tmp___3 [L155] COND FALSE !(!(init__r321 == 0)) [L2091] COND TRUE !(init__r311 == 0) [L2093] COND TRUE !(ep12 == 0) [L2095] init__tmp___4 = 1 [L159] init__r322 = (_Bool)init__tmp___4 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L160] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id3) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)r2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE !(init__r122 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE !(init__r132 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r212 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r232 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r312 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r322 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)st1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)st2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)nl1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)nl2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)mode1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)mode2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode3) == 0 [L214] init__tmp___5 = 1 [L215] __return_1709 = init__tmp___5 [L216] main__i2 = __return_1709 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE main__i2 != 0 [L219] p12_old = nomsg [L220] p12_new = nomsg [L221] p13_old = nomsg [L222] p13_new = nomsg [L223] p21_old = nomsg [L224] p21_new = nomsg [L225] p23_old = nomsg [L226] p23_new = nomsg [L227] p31_old = nomsg [L228] p31_new = nomsg [L229] p32_old = nomsg [L230] p32_new = nomsg [L231] main__i2 = 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE ((int)r1) < 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE !(ep12 == 0) [L245] int node1____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND TRUE max1 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND TRUE p12_new == nomsg [L250] node1____CPAchecker_TMP_0 = max1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep13 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] mode1 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L275] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE !(ep23 == 0) [L288] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE p23_new == nomsg [L293] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] mode2 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep31 == 0) [L309] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND TRUE p31_new == nomsg [L314] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L316] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=126, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=40, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=126, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] mode3 = 1 [L330] p12_old = p12_new [L331] p12_new = nomsg [L332] p13_old = p13_new [L333] p13_new = nomsg [L334] p21_old = p21_new [L335] p21_new = nomsg [L336] p23_old = p23_new [L337] p23_new = nomsg [L338] p31_old = p31_new [L339] p31_new = nomsg [L340] p32_old = p32_new [L341] p32_new = nomsg [L343] int check__tmp; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L352] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((int)r1) < 2 [L372] check__tmp = 1 [L373] __return_1837 = check__tmp [L374] main__c1 = __return_1837 [L376] _Bool __tmp_1; [L377] __tmp_1 = main__c1 [L378] _Bool assert__arg; [L379] assert__arg = __tmp_1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(assert__arg == 0) [L386] int main____CPAchecker_TMP_0 = main__i2; [L387] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=-128, m2=-128, m3=0, max1=40, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND TRUE !(mode1 == 0) [L393] r1 = (char)(((int)r1) + 1) [L394] COND FALSE !(!(ep21 == 0)) [L402] COND TRUE !(ep31 == 0) [L404] m1 = p31_old [L405] p31_old = nomsg [L406] COND TRUE ((int)m1) > ((int)max1) [L408] max1 = m1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-128, m3=0, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)r1) == 2) [L416] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-128, m3=0, max1=126, max2=41, max3=126, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=40, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE !(mode2 == 0) [L420] r2 = (char)(((int)r2) + 1) [L421] COND TRUE !(ep12 == 0) [L423] m2 = p12_old [L424] p12_old = nomsg [L425] COND FALSE !(((int)m2) > ((int)max2)) [L429] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=0, max1=126, max2=41, max3=126, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)r2) == 2) [L443] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=0, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE !(mode3 == 0) [L447] r3 = (char)(((int)r3) + 1) [L448] COND FALSE !(!(ep13 == 0)) [L456] COND TRUE !(ep23 == 0) [L458] m3 = p23_old [L459] p23_old = nomsg [L460] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND FALSE !(((int)r3) == 2) [L470] mode3 = 0 [L471] p12_old = p12_new [L472] p12_new = nomsg [L473] p13_old = p13_new [L474] p13_new = nomsg [L475] p21_old = p21_new [L476] p21_new = nomsg [L477] p23_old = p23_new [L478] p23_new = nomsg [L479] p31_old = p31_new [L480] p31_new = nomsg [L481] p32_old = p32_new [L482] p32_new = nomsg [L484] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int)r1) < 2 [L513] check__tmp = 1 [L514] __return_1955 = check__tmp [L515] main__c1 = __return_1955 [L517] _Bool __tmp_2; [L518] __tmp_2 = main__c1 [L519] _Bool assert__arg; [L520] assert__arg = __tmp_2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND FALSE !(assert__arg == 0) [L527] int main____CPAchecker_TMP_0 = main__i2; [L528] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L529] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L538] COND FALSE !(((int)r1) < 1) [L544] mode1 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L552] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L565] COND TRUE !(ep23 == 0) [L567] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L570] COND TRUE p23_new == nomsg [L572] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L574] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L576] mode2 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L584] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] COND TRUE !(ep31 == 0) [L588] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L589] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L591] COND TRUE p31_new == nomsg [L593] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L595] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=126, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=41, p23_old=-1, p31=0, p31_new=126, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L608] mode3 = 1 [L609] p12_old = p12_new [L610] p12_new = nomsg [L611] p13_old = p13_new [L612] p13_new = nomsg [L613] p21_old = p21_new [L614] p21_new = nomsg [L615] p23_old = p23_new [L616] p23_new = nomsg [L617] p31_old = p31_new [L618] p31_new = nomsg [L619] p32_old = p32_new [L620] p32_new = nomsg [L622] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L623] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L625] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L627] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L631] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L637] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L647] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L649] COND TRUE ((int)r1) < 2 [L651] check__tmp = 1 [L652] __return_2060 = check__tmp [L653] main__c1 = __return_2060 [L655] _Bool __tmp_3; [L656] __tmp_3 = main__c1 [L657] _Bool assert__arg; [L658] assert__arg = __tmp_3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L659] COND FALSE !(assert__arg == 0) [L665] int main____CPAchecker_TMP_0 = main__i2; [L666] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L667] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L670] COND TRUE !(mode1 == 0) [L672] r1 = (char)(((int)r1) + 1) [L673] COND FALSE !(!(ep21 == 0)) [L681] COND TRUE !(ep31 == 0) [L683] m1 = p31_old [L684] p31_old = nomsg [L685] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L689] COND TRUE ((int)r1) == 2 [L691] COND FALSE !(((int)max1) == ((int)id1)) [L1470] nl1 = 1 [L695] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=40, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L697] COND TRUE !(mode2 == 0) [L699] r2 = (char)(((int)r2) + 1) [L700] COND TRUE !(ep12 == 0) [L702] m2 = p12_old [L703] p12_old = nomsg [L704] COND FALSE !(((int)m2) > ((int)max2)) [L708] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L716] COND TRUE ((int)r2) == 2 [L718] COND TRUE ((int)max2) == ((int)id2) [L720] st2 = 1 [L722] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=41, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L724] COND TRUE !(mode3 == 0) [L726] r3 = (char)(((int)r3) + 1) [L727] COND FALSE !(!(ep13 == 0)) [L735] COND TRUE !(ep23 == 0) [L737] m3 = p23_old [L738] p23_old = nomsg [L739] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L743] COND TRUE ((int)r3) == 2 [L745] COND TRUE ((int)max3) == ((int)id3) [L747] st3 = 1 [L749] mode3 = 0 [L750] p12_old = p12_new [L751] p12_new = nomsg [L752] p13_old = p13_new [L753] p13_new = nomsg [L754] p21_old = p21_new [L755] p21_new = nomsg [L756] p23_old = p23_new [L757] p23_new = nomsg [L758] p31_old = p31_new [L759] p31_new = nomsg [L760] p32_old = p32_new [L761] p32_new = nomsg [L763] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L764] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1389] check__tmp = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L792] __return_2183 = check__tmp [L793] main__c1 = __return_2183 [L794] __tmp_2184_0 = main____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L796] main____CPAchecker_TMP_0 = __tmp_2184_0 [L798] _Bool __tmp_4; [L799] __tmp_4 = main__c1 [L800] _Bool assert__arg; [L801] assert__arg = __tmp_4 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L802] COND TRUE assert__arg == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L804] __VERIFIER_error() VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=40, id2=41, id3=126, m1=126, m2=-1, m3=41, max1=126, max2=41, max3=126, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -113.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1273.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.8 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. * CodeCheck took 732032.49 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Free memory was 1.0 GB in the beginning and 499.2 MB in the end (delta: 537.8 MB). Peak memory consumption was 540.9 MB. Max. memory is 11.5 GB. * Witness Printer took 143.50 ms. Allocated memory is still 1.1 GB. Free memory was 499.2 MB in the beginning and 448.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...