./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/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_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/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.24-678e011 [2019-11-20 10:27:44,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:27:44,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:27:44,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:27:44,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:27:44,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:27:44,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:27:44,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:27:44,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:27:44,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:27:44,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:27:44,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:27:44,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:27:44,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:27:44,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:27:44,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:27:44,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:27:44,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:27:44,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:27:44,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:27:44,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:27:44,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:27:44,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:27:44,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:27:44,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:27:44,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:27:44,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:27:44,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:27:44,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:27:44,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:27:44,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:27:44,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:27:44,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:27:44,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:27:44,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:27:44,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:27:44,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:27:44,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:27:44,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:27:44,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:27:44,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:27:44,285 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 10:27:44,311 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:27:44,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:27:44,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 10:27:44,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 10:27:44,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:27:44,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:27:44,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:27:44,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:27:44,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:27:44,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:27:44,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:27:44,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:27:44,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:27:44,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:27:44,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:27:44,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:27:44,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:27:44,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:27:44,327 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 10:27:44,327 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 10:27:44,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:27:44,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:27:44,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 10:27:44,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:27:44,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:27:44,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:27:44,331 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 10:27:44,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:27:44,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:27:44,331 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_c3429aab-87ca-4f42-a456-d74ebf06a4ad/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-11-20 10:27:44,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:27:44,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:27:44,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:27:44,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:27:44,546 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:27:44,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 10:27:44,607 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/data/471d0800e/ece286d18cc14041a7afa9adc1b9d862/FLAG98dd4c79d [2019-11-20 10:27:45,075 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:27:45,076 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-20 10:27:45,089 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/data/471d0800e/ece286d18cc14041a7afa9adc1b9d862/FLAG98dd4c79d [2019-11-20 10:27:45,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/data/471d0800e/ece286d18cc14041a7afa9adc1b9d862 [2019-11-20 10:27:45,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:27:45,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:27:45,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:27:45,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:27:45,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:27:45,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:27:45" (1/1) ... [2019-11-20 10:27:45,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb4c7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:45, skipping insertion in model container [2019-11-20 10:27:45,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:27:45" (1/1) ... [2019-11-20 10:27:45,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:27:45,442 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:27:45,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:27:45,984 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:27:46,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:27:46,177 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:27:46,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46 WrapperNode [2019-11-20 10:27:46,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:27:46,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:27:46,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:27:46,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:27:46,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:27:46,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:27:46,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:27:46,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:27:46,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... [2019-11-20 10:27:46,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:27:46,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:27:46,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:27:46,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:27:46,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:27:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/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-11-20 10:27:46,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:27:46,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:27:48,831 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:27:48,831 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 10:27:48,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:27:48 BoogieIcfgContainer [2019-11-20 10:27:48,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:27:48,833 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 10:27:48,833 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 10:27:48,845 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 10:27:48,846 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:27:48" (1/1) ... [2019-11-20 10:27:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:27:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 215 states and 378 transitions. [2019-11-20 10:27:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 378 transitions. [2019-11-20 10:27:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:27:48,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:49,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-11-20 10:27:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 221 states and 389 transitions. [2019-11-20 10:27:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 389 transitions. [2019-11-20 10:27:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:50,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:50,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-11-20 10:27:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 221 states and 388 transitions. [2019-11-20 10:27:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 388 transitions. [2019-11-20 10:27:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:50,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 227 states and 398 transitions. [2019-11-20 10:27:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 398 transitions. [2019-11-20 10:27:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:52,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 270 states and 483 transitions. [2019-11-20 10:27:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 483 transitions. [2019-11-20 10:27:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:52,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:52,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-11-20 10:27:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 269 states and 481 transitions. [2019-11-20 10:27:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 481 transitions. [2019-11-20 10:27:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:53,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 312 states and 566 transitions. [2019-11-20 10:27:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 566 transitions. [2019-11-20 10:27:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:53,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 311 states and 562 transitions. [2019-11-20 10:27:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 562 transitions. [2019-11-20 10:27:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:53,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 324 states and 586 transitions. [2019-11-20 10:27:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 586 transitions. [2019-11-20 10:27:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:27:57,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 326 states and 590 transitions. [2019-11-20 10:27:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 590 transitions. [2019-11-20 10:27:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:27:58,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 323 states and 584 transitions. [2019-11-20 10:27:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 584 transitions. [2019-11-20 10:27:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:27:59,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 326 states and 589 transitions. [2019-11-20 10:28:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 589 transitions. [2019-11-20 10:28:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:01,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 323 states and 582 transitions. [2019-11-20 10:28:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 582 transitions. [2019-11-20 10:28:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:02,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 323 states and 581 transitions. [2019-11-20 10:28:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 581 transitions. [2019-11-20 10:28:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:03,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 326 states and 586 transitions. [2019-11-20 10:28:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 586 transitions. [2019-11-20 10:28:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:03,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 327 states and 586 transitions. [2019-11-20 10:28:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 586 transitions. [2019-11-20 10:28:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:04,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 330 states and 591 transitions. [2019-11-20 10:28:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 591 transitions. [2019-11-20 10:28:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:04,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 331 states and 591 transitions. [2019-11-20 10:28:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 591 transitions. [2019-11-20 10:28:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:04,342 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 376 states and 679 transitions. [2019-11-20 10:28:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 679 transitions. [2019-11-20 10:28:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:05,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 428 states and 785 transitions. [2019-11-20 10:28:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 785 transitions. [2019-11-20 10:28:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:16,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 440 states and 803 transitions. [2019-11-20 10:28:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 803 transitions. [2019-11-20 10:28:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:17,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 443 states and 808 transitions. [2019-11-20 10:28:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 808 transitions. [2019-11-20 10:28:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:17,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 444 states and 808 transitions. [2019-11-20 10:28:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 808 transitions. [2019-11-20 10:28:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:17,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 447 states and 813 transitions. [2019-11-20 10:28:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 813 transitions. [2019-11-20 10:28:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:18,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:18,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-11-20 10:28:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 448 states and 813 transitions. [2019-11-20 10:28:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 813 transitions. [2019-11-20 10:28:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:18,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 451 states and 818 transitions. [2019-11-20 10:28:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 818 transitions. [2019-11-20 10:28:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:18,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 452 states and 820 transitions. [2019-11-20 10:28:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 820 transitions. [2019-11-20 10:28:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:19,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:19,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-11-20 10:28:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 495 states and 903 transitions. [2019-11-20 10:28:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 903 transitions. [2019-11-20 10:28:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:28:21,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 494 states and 901 transitions. [2019-11-20 10:28:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 901 transitions. [2019-11-20 10:28:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:28:21,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 492 states and 896 transitions. [2019-11-20 10:28:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 896 transitions. [2019-11-20 10:28:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:28:23,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 474 states and 866 transitions. [2019-11-20 10:28:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 866 transitions. [2019-11-20 10:28:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:28:24,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 482 states and 881 transitions. [2019-11-20 10:28:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 881 transitions. [2019-11-20 10:28:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:28:27,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 489 states and 897 transitions. [2019-11-20 10:28:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 897 transitions. [2019-11-20 10:28:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:30,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 516 states and 947 transitions. [2019-11-20 10:28:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 947 transitions. [2019-11-20 10:28:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:37,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 523 states and 959 transitions. [2019-11-20 10:28:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 959 transitions. [2019-11-20 10:28:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:39,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 530 states and 970 transitions. [2019-11-20 10:28:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 970 transitions. [2019-11-20 10:28:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:40,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 530 states and 969 transitions. [2019-11-20 10:28:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 969 transitions. [2019-11-20 10:28:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:41,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:41,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-11-20 10:28:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 533 states and 974 transitions. [2019-11-20 10:28:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 974 transitions. [2019-11-20 10:28:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:41,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 575 states and 1060 transitions. [2019-11-20 10:28:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1060 transitions. [2019-11-20 10:28:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:45,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:45,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-11-20 10:28:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 592 states and 1093 transitions. [2019-11-20 10:28:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1093 transitions. [2019-11-20 10:28:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:45,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 632 states and 1169 transitions. [2019-11-20 10:28:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1169 transitions. [2019-11-20 10:28:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:47,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 633 states and 1169 transitions. [2019-11-20 10:28:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1169 transitions. [2019-11-20 10:28:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:47,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 632 states and 1165 transitions. [2019-11-20 10:28:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1165 transitions. [2019-11-20 10:28:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:48,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 635 states and 1170 transitions. [2019-11-20 10:28:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1170 transitions. [2019-11-20 10:28:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:48,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 636 states and 1170 transitions. [2019-11-20 10:28:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1170 transitions. [2019-11-20 10:28:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:48,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 639 states and 1174 transitions. [2019-11-20 10:28:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1174 transitions. [2019-11-20 10:28:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:50,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:50,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-11-20 10:28:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 641 states and 1178 transitions. [2019-11-20 10:28:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1178 transitions. [2019-11-20 10:28:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:52,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 642 states and 1179 transitions. [2019-11-20 10:28:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1179 transitions. [2019-11-20 10:28:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:52,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 647 states and 1188 transitions. [2019-11-20 10:28:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1188 transitions. [2019-11-20 10:28:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:53,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 648 states and 1190 transitions. [2019-11-20 10:28:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1190 transitions. [2019-11-20 10:28:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:55,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:28:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 651 states and 1194 transitions. [2019-11-20 10:28:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1194 transitions. [2019-11-20 10:28:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:28:56,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:29:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:29:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 709 states and 1304 transitions. [2019-11-20 10:29:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1304 transitions. [2019-11-20 10:29:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:29:19,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:29:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:29:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:29:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:29:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 725 states and 1339 transitions. [2019-11-20 10:29:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1339 transitions. [2019-11-20 10:29:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:29:47,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:29:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:29:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:29:50,564 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-20 10:29:51,511 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-20 10:29:53,449 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-20 10:29:53,887 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 10:29:55,839 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-20 10:29:56,221 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-11-20 10:29:58,014 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-20 10:29:58,464 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-20 10:30:00,481 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-20 10:30:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 738 states and 1359 transitions. [2019-11-20 10:30:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1359 transitions. [2019-11-20 10:30:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:30:08,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 739 states and 1362 transitions. [2019-11-20 10:30:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1362 transitions. [2019-11-20 10:30:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:30:10,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 743 states and 1369 transitions. [2019-11-20 10:30:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1369 transitions. [2019-11-20 10:30:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:30:12,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 747 states and 1374 transitions. [2019-11-20 10:30:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1374 transitions. [2019-11-20 10:30:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:14,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 754 states and 1387 transitions. [2019-11-20 10:30:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1387 transitions. [2019-11-20 10:30:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:23,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 754 states and 1386 transitions. [2019-11-20 10:30:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1386 transitions. [2019-11-20 10:30:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:29,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 758 states and 1393 transitions. [2019-11-20 10:30:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1393 transitions. [2019-11-20 10:30:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:32,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 758 states and 1391 transitions. [2019-11-20 10:30:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1391 transitions. [2019-11-20 10:30:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:33,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 764 states and 1401 transitions. [2019-11-20 10:30:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1401 transitions. [2019-11-20 10:30:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:39,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 771 states and 1416 transitions. [2019-11-20 10:30:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1416 transitions. [2019-11-20 10:30:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:46,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:30:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 785 states and 1439 transitions. [2019-11-20 10:30:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1439 transitions. [2019-11-20 10:30:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:30:57,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:30:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:31:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:31:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 793 states and 1458 transitions. [2019-11-20 10:31:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1458 transitions. [2019-11-20 10:31:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:31:06,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:31:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:31:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:31:14,203 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 10:31:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:31:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 811 states and 1489 transitions. [2019-11-20 10:31:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1489 transitions. [2019-11-20 10:31:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:31:23,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:31:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:31:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:31:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:31:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 815 states and 1496 transitions. [2019-11-20 10:31:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1496 transitions. [2019-11-20 10:31:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:31:24,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:31:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:31:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:31:28,460 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-20 10:31:31,113 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-11-20 10:31:33,780 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-11-20 10:31:36,488 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-20 10:32:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:32:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 829 states and 1524 transitions. [2019-11-20 10:32:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1524 transitions. [2019-11-20 10:32:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:32:10,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:32:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:32:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:32:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:32:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 813 states and 1485 transitions. [2019-11-20 10:32:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1485 transitions. [2019-11-20 10:32:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:32:12,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:32:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:32:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:32:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:32:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 815 states and 1494 transitions. [2019-11-20 10:32:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1494 transitions. [2019-11-20 10:32:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:32:18,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:32:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:32:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:32:45,070 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 10:33:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 821 states and 1502 transitions. [2019-11-20 10:33:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1502 transitions. [2019-11-20 10:33:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:05,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 820 states and 1498 transitions. [2019-11-20 10:33:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1498 transitions. [2019-11-20 10:33:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:07,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:07,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-11-20 10:33:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 820 states and 1497 transitions. [2019-11-20 10:33:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1497 transitions. [2019-11-20 10:33:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:09,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:09,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-11-20 10:33:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 806 states and 1475 transitions. [2019-11-20 10:33:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1475 transitions. [2019-11-20 10:33:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:18,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:18,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-11-20 10:33:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 808 states and 1477 transitions. [2019-11-20 10:33:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1477 transitions. [2019-11-20 10:33:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:22,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 812 states and 1482 transitions. [2019-11-20 10:33:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1482 transitions. [2019-11-20 10:33:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:24,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 800 states and 1456 transitions. [2019-11-20 10:33:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1456 transitions. [2019-11-20 10:33:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:29,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 787 states and 1437 transitions. [2019-11-20 10:33:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1437 transitions. [2019-11-20 10:33:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:33,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 785 states and 1432 transitions. [2019-11-20 10:33:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1432 transitions. [2019-11-20 10:33:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:36,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 788 states and 1439 transitions. [2019-11-20 10:33:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1439 transitions. [2019-11-20 10:33:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:38,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 791 states and 1448 transitions. [2019-11-20 10:33:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1448 transitions. [2019-11-20 10:33:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:43,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 792 states and 1449 transitions. [2019-11-20 10:33:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1449 transitions. [2019-11-20 10:33:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:44,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:33:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:33:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 793 states and 1450 transitions. [2019-11-20 10:33:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1450 transitions. [2019-11-20 10:33:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:33:46,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:33:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:33:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 849 states and 1563 transitions. [2019-11-20 10:34:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1563 transitions. [2019-11-20 10:34:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:13,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:13,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-11-20 10:34:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 865 states and 1593 transitions. [2019-11-20 10:34:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1593 transitions. [2019-11-20 10:34:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:23,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 882 states and 1626 transitions. [2019-11-20 10:34:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1626 transitions. [2019-11-20 10:34:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:30,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 883 states and 1626 transitions. [2019-11-20 10:34:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1626 transitions. [2019-11-20 10:34:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:31,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 884 states and 1626 transitions. [2019-11-20 10:34:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1626 transitions. [2019-11-20 10:34:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:32,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 887 states and 1633 transitions. [2019-11-20 10:34:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1633 transitions. [2019-11-20 10:34:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:34,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 889 states and 1634 transitions. [2019-11-20 10:34:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1634 transitions. [2019-11-20 10:34:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:34,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 892 states and 1639 transitions. [2019-11-20 10:34:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1639 transitions. [2019-11-20 10:34:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:39,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 908 states and 1669 transitions. [2019-11-20 10:34:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1669 transitions. [2019-11-20 10:34:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:54,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:34:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:34:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 909 states and 1669 transitions. [2019-11-20 10:34:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1669 transitions. [2019-11-20 10:34:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:34:57,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:34:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:34:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 955 states and 1759 transitions. [2019-11-20 10:35:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1759 transitions. [2019-11-20 10:35:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:13,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 951 states and 1749 transitions. [2019-11-20 10:35:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1749 transitions. [2019-11-20 10:35:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:15,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 994 states and 1829 transitions. [2019-11-20 10:35:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1829 transitions. [2019-11-20 10:35:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:27,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:27,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-11-20 10:35:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 996 states and 1834 transitions. [2019-11-20 10:35:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1834 transitions. [2019-11-20 10:35:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:33,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1037 states and 1914 transitions. [2019-11-20 10:35:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1914 transitions. [2019-11-20 10:35:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:35,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1033 states and 1906 transitions. [2019-11-20 10:35:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1906 transitions. [2019-11-20 10:35:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:37,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1034 states and 1906 transitions. [2019-11-20 10:35:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1906 transitions. [2019-11-20 10:35:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:37,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1033 states and 1903 transitions. [2019-11-20 10:35:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1903 transitions. [2019-11-20 10:35:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:37,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1078 states and 1990 transitions. [2019-11-20 10:35:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1990 transitions. [2019-11-20 10:35:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:42,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:42,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-11-20 10:35:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1079 states and 1990 transitions. [2019-11-20 10:35:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1990 transitions. [2019-11-20 10:35:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:35:42,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:42,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-11-20 10:35:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1078 states and 1987 transitions. [2019-11-20 10:35:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1987 transitions. [2019-11-20 10:35:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:35:42,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1077 states and 1985 transitions. [2019-11-20 10:35:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1985 transitions. [2019-11-20 10:35:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:35:55,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:35:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:35:56,686 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 10:36:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1056 states and 1947 transitions. [2019-11-20 10:36:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1947 transitions. [2019-11-20 10:36:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:06,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1062 states and 1958 transitions. [2019-11-20 10:36:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1958 transitions. [2019-11-20 10:36:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:17,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:17,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-11-20 10:36:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1062 states and 1957 transitions. [2019-11-20 10:36:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1957 transitions. [2019-11-20 10:36:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:33,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1070 states and 1972 transitions. [2019-11-20 10:36:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1972 transitions. [2019-11-20 10:36:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:47,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:47,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-11-20 10:36:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1046 states and 1921 transitions. [2019-11-20 10:36:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1921 transitions. [2019-11-20 10:36:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:55,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1050 states and 1928 transitions. [2019-11-20 10:36:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1928 transitions. [2019-11-20 10:36:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:36:57,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1020 states and 1870 transitions. [2019-11-20 10:37:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1870 transitions. [2019-11-20 10:37:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:06,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 891 states and 1626 transitions. [2019-11-20 10:37:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1626 transitions. [2019-11-20 10:37:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:09,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 833 states and 1517 transitions. [2019-11-20 10:37:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1517 transitions. [2019-11-20 10:37:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:11,342 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 847 states and 1539 transitions. [2019-11-20 10:37:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1539 transitions. [2019-11-20 10:37:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:20,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 865 states and 1574 transitions. [2019-11-20 10:37:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1574 transitions. [2019-11-20 10:37:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:38,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:38,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-11-20 10:37:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 866 states and 1574 transitions. [2019-11-20 10:37:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1574 transitions. [2019-11-20 10:37:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:40,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 867 states and 1574 transitions. [2019-11-20 10:37:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1574 transitions. [2019-11-20 10:37:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:43,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:37:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 879 states and 1598 transitions. [2019-11-20 10:37:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1598 transitions. [2019-11-20 10:37:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:37:56,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:37:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:38:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 882 states and 1605 transitions. [2019-11-20 10:38:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1605 transitions. [2019-11-20 10:38:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:38:02,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:38:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:38:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 883 states and 1605 transitions. [2019-11-20 10:38:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1605 transitions. [2019-11-20 10:38:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:38:07,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:38:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:38:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 884 states and 1605 transitions. [2019-11-20 10:38:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1605 transitions. [2019-11-20 10:38:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 10:38:09,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:38:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:10,084 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 122 iterations. [2019-11-20 10:38:10,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 10:38:10 ImpRootNode [2019-11-20 10:38:10,431 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 10:38:10,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:38:10,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:38:10,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:38:10,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:27:48" (3/4) ... [2019-11-20 10:38:10,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 10:38:10,683 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3429aab-87ca-4f42-a456-d74ebf06a4ad/bin/ukojak/witness.graphml [2019-11-20 10:38:10,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:38:10,687 INFO L168 Benchmark]: Toolchain (without parser) took 625314.73 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 940.6 MB in the beginning and 835.4 MB in the end (delta: 105.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,687 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:38:10,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,688 INFO L168 Benchmark]: Boogie Preprocessor took 51.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,689 INFO L168 Benchmark]: RCFGBuilder took 2514.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 246.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,689 INFO L168 Benchmark]: CodeCheck took 621598.93 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 189.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,689 INFO L168 Benchmark]: Witness Printer took 253.71 ms. Allocated memory is still 3.2 GB. Free memory was 894.9 MB in the beginning and 835.4 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:10,691 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: 621.2s, OverallIterations: 122, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1359303760 SDtfs, 1485121196 SDslu, -1527275928 SDs, 0 SdLazy, -803957336 SolverSat, -704609408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 236.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114480 GetRequests, 111130 SyntacticMatches, 1816 SemanticMatches, 1534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278174 ImplicationChecksByTransitivity, 603.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 14591 NumberOfCodeBlocks, 14591 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 14345 ConstructedInterpolants, 0 QuantifiedInterpolants, 6955708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 121 InterpolantComputations, 121 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=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L160] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id3) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)r2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE !(init__r122 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE !(init__r132 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r212 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r232 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r312 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r322 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)st1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)st2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)nl1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)nl2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)mode1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)mode2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode3) == 0 [L214] init__tmp___5 = 1 [L215] __return_1709 = init__tmp___5 [L216] main__i2 = __return_1709 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE main__i2 != 0 [L219] p12_old = nomsg [L220] p12_new = nomsg [L221] p13_old = nomsg [L222] p13_new = nomsg [L223] p21_old = nomsg [L224] p21_new = nomsg [L225] p23_old = nomsg [L226] p23_new = nomsg [L227] p31_old = nomsg [L228] p31_new = nomsg [L229] p32_old = nomsg [L230] p32_new = nomsg [L231] main__i2 = 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L232] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE ((int)r1) < 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE !(ep12 == 0) [L245] int node1____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND TRUE max1 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND TRUE p12_new == nomsg [L250] node1____CPAchecker_TMP_0 = max1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep13 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] mode1 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L275] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE !(ep23 == 0) [L288] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE p23_new == nomsg [L293] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] mode2 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE !(ep31 == 0) [L309] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND TRUE p31_new == nomsg [L314] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L316] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=127, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=127, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] mode3 = 1 [L330] p12_old = p12_new [L331] p12_new = nomsg [L332] p13_old = p13_new [L333] p13_new = nomsg [L334] p21_old = p21_new [L335] p21_new = nomsg [L336] p23_old = p23_new [L337] p23_new = nomsg [L338] p31_old = p31_new [L339] p31_new = nomsg [L340] p32_old = p32_new [L341] p32_new = nomsg [L343] int check__tmp; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L352] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((int)r1) < 2 [L372] check__tmp = 1 [L373] __return_1837 = check__tmp [L374] main__c1 = __return_1837 [L376] _Bool __tmp_1; [L377] __tmp_1 = main__c1 [L378] _Bool assert__arg; [L379] assert__arg = __tmp_1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(assert__arg == 0) [L386] int main____CPAchecker_TMP_0 = main__i2; [L387] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=0, m2=-128, m3=-128, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND TRUE !(mode1 == 0) [L393] r1 = (char)(((int)r1) + 1) [L394] COND FALSE !(!(ep21 == 0)) [L402] COND TRUE !(ep31 == 0) [L404] m1 = p31_old [L405] p31_old = nomsg [L406] COND TRUE ((int)m1) > ((int)max1) [L408] max1 = m1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-128, m3=-128, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)r1) == 2) [L416] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-128, m3=-128, max1=127, max2=126, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE !(mode2 == 0) [L420] r2 = (char)(((int)r2) + 1) [L421] COND TRUE !(ep12 == 0) [L423] m2 = p12_old [L424] p12_old = nomsg [L425] COND FALSE !(((int)m2) > ((int)max2)) [L429] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=-128, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)r2) == 2) [L443] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=-128, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE !(mode3 == 0) [L447] r3 = (char)(((int)r3) + 1) [L448] COND FALSE !(!(ep13 == 0)) [L456] COND TRUE !(ep23 == 0) [L458] m3 = p23_old [L459] p23_old = nomsg [L460] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND FALSE !(((int)r3) == 2) [L470] mode3 = 0 [L471] p12_old = p12_new [L472] p12_new = nomsg [L473] p13_old = p13_new [L474] p13_new = nomsg [L475] p21_old = p21_new [L476] p21_new = nomsg [L477] p23_old = p23_new [L478] p23_new = nomsg [L479] p31_old = p31_new [L480] p31_new = nomsg [L481] p32_old = p32_new [L482] p32_new = nomsg [L484] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int)r1) < 2 [L513] check__tmp = 1 [L514] __return_1955 = check__tmp [L515] main__c1 = __return_1955 [L517] _Bool __tmp_2; [L518] __tmp_2 = main__c1 [L519] _Bool assert__arg; [L520] assert__arg = __tmp_2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND FALSE !(assert__arg == 0) [L527] int main____CPAchecker_TMP_0 = main__i2; [L528] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L529] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L538] COND FALSE !(((int)r1) < 1) [L544] mode1 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L552] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] COND FALSE !(!(ep21 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L565] COND TRUE !(ep23 == 0) [L567] int node2____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L570] COND TRUE p23_new == nomsg [L572] node2____CPAchecker_TMP_1 = max2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L574] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L576] mode2 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L584] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] COND TRUE !(ep31 == 0) [L588] int node3____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L589] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L591] COND TRUE p31_new == nomsg [L593] node3____CPAchecker_TMP_0 = max3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L595] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=127, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p23_old=-1, p31=0, p31_new=127, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L608] mode3 = 1 [L609] p12_old = p12_new [L610] p12_new = nomsg [L611] p13_old = p13_new [L612] p13_new = nomsg [L613] p21_old = p21_new [L614] p21_new = nomsg [L615] p23_old = p23_new [L616] p23_new = nomsg [L617] p31_old = p31_new [L618] p31_new = nomsg [L619] p32_old = p32_new [L620] p32_new = nomsg [L622] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L623] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L625] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L627] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L631] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L637] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L647] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L649] COND TRUE ((int)r1) < 2 [L651] check__tmp = 1 [L652] __return_2060 = check__tmp [L653] main__c1 = __return_2060 [L655] _Bool __tmp_3; [L656] __tmp_3 = main__c1 [L657] _Bool assert__arg; [L658] assert__arg = __tmp_3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L659] COND FALSE !(assert__arg == 0) [L665] int main____CPAchecker_TMP_0 = main__i2; [L666] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L667] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L670] COND TRUE !(mode1 == 0) [L672] r1 = (char)(((int)r1) + 1) [L673] COND FALSE !(!(ep21 == 0)) [L681] COND TRUE !(ep31 == 0) [L683] m1 = p31_old [L684] p31_old = nomsg [L685] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L689] COND TRUE ((int)r1) == 2 [L691] COND FALSE !(((int)max1) == ((int)id1)) [L1470] nl1 = 1 [L695] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L697] COND TRUE !(mode2 == 0) [L699] r2 = (char)(((int)r2) + 1) [L700] COND TRUE !(ep12 == 0) [L702] m2 = p12_old [L703] p12_old = nomsg [L704] COND FALSE !(((int)m2) > ((int)max2)) [L708] COND FALSE !(!(ep32 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L716] COND TRUE ((int)r2) == 2 [L718] COND TRUE ((int)max2) == ((int)id2) [L720] st2 = 1 [L722] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L724] COND TRUE !(mode3 == 0) [L726] r3 = (char)(((int)r3) + 1) [L727] COND FALSE !(!(ep13 == 0)) [L735] COND TRUE !(ep23 == 0) [L737] m3 = p23_old [L738] p23_old = nomsg [L739] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L743] COND TRUE ((int)r3) == 2 [L745] COND TRUE ((int)max3) == ((int)id3) [L747] st3 = 1 [L749] mode3 = 0 [L750] p12_old = p12_new [L751] p12_new = nomsg [L752] p13_old = p13_new [L753] p13_new = nomsg [L754] p21_old = p21_new [L755] p21_new = nomsg [L756] p23_old = p23_new [L757] p23_new = nomsg [L758] p31_old = p31_new [L759] p31_new = nomsg [L760] p32_old = p32_new [L761] p32_new = nomsg [L763] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L764] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1389] check__tmp = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L792] __return_2183 = check__tmp [L793] main__c1 = __return_2183 [L794] __tmp_2184_0 = main____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L796] main____CPAchecker_TMP_0 = __tmp_2184_0 [L798] _Bool __tmp_4; [L799] __tmp_4 = main__c1 [L800] _Bool assert__arg; [L801] assert__arg = __tmp_4 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L802] COND TRUE assert__arg == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L804] __VERIFIER_error() VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 805.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2514.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 246.8 MB. Max. memory is 11.5 GB. * CodeCheck took 621598.93 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 189.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 253.71 ms. Allocated memory is still 3.2 GB. Free memory was 894.9 MB in the beginning and 835.4 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...