./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5502f9672f054c34b790763a9f35b59444705f97 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:49:52,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:49:52,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:49:52,429 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:49:52,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:49:52,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:49:52,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:49:52,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:49:52,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:49:52,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:49:52,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:49:52,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:49:52,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:49:52,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:49:52,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:49:52,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:49:52,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:49:52,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:49:52,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:49:52,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:49:52,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:49:52,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:49:52,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:49:52,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:49:52,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:49:52,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:49:52,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:49:52,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:49:52,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:49:52,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:49:52,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:49:52,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:49:52,449 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:49:52,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:49:52,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:49:52,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:49:52,450 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 08:49:52,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:49:52,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:49:52,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:49:52,462 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:49:52,462 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:49:52,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:49:52,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:49:52,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:49:52,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:49:52,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:49:52,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:49:52,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:49:52,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:49:52,464 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 08:49:52,465 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 08:49:52,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:49:52,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:49:52,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 08:49:52,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:49:52,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:49:52,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:49:52,466 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 08:49:52,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:49:52,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:49:52,466 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5502f9672f054c34b790763a9f35b59444705f97 [2018-11-18 08:49:52,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:49:52,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:49:52,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:49:52,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:49:52,502 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:49:52,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2018-11-18 08:49:52,539 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/data/79c618519/256e937aa29b4cb281fe70477718c4f6/FLAG843096a87 [2018-11-18 08:49:52,927 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:49:52,927 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2018-11-18 08:49:52,936 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/data/79c618519/256e937aa29b4cb281fe70477718c4f6/FLAG843096a87 [2018-11-18 08:49:53,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/data/79c618519/256e937aa29b4cb281fe70477718c4f6 [2018-11-18 08:49:53,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:49:53,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:49:53,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:49:53,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:49:53,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:49:53,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6047e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53, skipping insertion in model container [2018-11-18 08:49:53,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:49:53,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:49:53,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:49:53,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:49:53,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:49:53,736 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:49:53,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53 WrapperNode [2018-11-18 08:49:53,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:49:53,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:49:53,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:49:53,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:49:53,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:49:53,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:49:53,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:49:53,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:49:53,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... [2018-11-18 08:49:53,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:49:53,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:49:53,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:49:53,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:49:53,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 08:49:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:49:53,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:49:55,422 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:49:55,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:55 BoogieIcfgContainer [2018-11-18 08:49:55,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:49:55,424 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 08:49:55,424 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 08:49:55,433 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 08:49:55,434 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:55" (1/1) ... [2018-11-18 08:49:55,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:49:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 188 states and 332 transitions. [2018-11-18 08:49:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 332 transitions. [2018-11-18 08:49:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 08:49:55,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 199 states and 359 transitions. [2018-11-18 08:49:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-18 08:49:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:55,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 201 states and 363 transitions. [2018-11-18 08:49:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 363 transitions. [2018-11-18 08:49:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:56,229 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 212 states and 390 transitions. [2018-11-18 08:49:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 390 transitions. [2018-11-18 08:49:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:56,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 214 states and 392 transitions. [2018-11-18 08:49:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 392 transitions. [2018-11-18 08:49:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:56,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 221 states and 410 transitions. [2018-11-18 08:49:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 410 transitions. [2018-11-18 08:49:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:57,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 222 states and 412 transitions. [2018-11-18 08:49:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 412 transitions. [2018-11-18 08:49:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 08:49:57,225 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 222 states and 410 transitions. [2018-11-18 08:49:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 410 transitions. [2018-11-18 08:49:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:57,272 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 225 states and 418 transitions. [2018-11-18 08:49:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 418 transitions. [2018-11-18 08:49:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:58,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:49:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:49:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 229 states and 424 transitions. [2018-11-18 08:49:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 424 transitions. [2018-11-18 08:49:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:49:59,427 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:49:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:49:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 241 states and 454 transitions. [2018-11-18 08:50:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 454 transitions. [2018-11-18 08:50:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:02,436 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 245 states and 460 transitions. [2018-11-18 08:50:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 460 transitions. [2018-11-18 08:50:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:03,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 248 states and 464 transitions. [2018-11-18 08:50:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 464 transitions. [2018-11-18 08:50:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:03,573 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 254 states and 478 transitions. [2018-11-18 08:50:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 478 transitions. [2018-11-18 08:50:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:08,589 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 258 states and 484 transitions. [2018-11-18 08:50:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 484 transitions. [2018-11-18 08:50:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:08,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 266 states and 504 transitions. [2018-11-18 08:50:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 504 transitions. [2018-11-18 08:50:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:16,116 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 271 states and 514 transitions. [2018-11-18 08:50:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 514 transitions. [2018-11-18 08:50:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:16,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 273 states and 520 transitions. [2018-11-18 08:50:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 520 transitions. [2018-11-18 08:50:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:17,975 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 279 states and 536 transitions. [2018-11-18 08:50:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 536 transitions. [2018-11-18 08:50:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 08:50:19,069 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 279 states and 535 transitions. [2018-11-18 08:50:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 535 transitions. [2018-11-18 08:50:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:20,257 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 283 states and 543 transitions. [2018-11-18 08:50:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 543 transitions. [2018-11-18 08:50:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:21,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 287 states and 549 transitions. [2018-11-18 08:50:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 549 transitions. [2018-11-18 08:50:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:22,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 291 states and 557 transitions. [2018-11-18 08:50:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 557 transitions. [2018-11-18 08:50:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:25,519 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 295 states and 563 transitions. [2018-11-18 08:50:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 563 transitions. [2018-11-18 08:50:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:26,445 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 304 states and 584 transitions. [2018-11-18 08:50:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 584 transitions. [2018-11-18 08:50:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:30,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 312 states and 607 transitions. [2018-11-18 08:50:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 607 transitions. [2018-11-18 08:50:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:34,095 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 314 states and 612 transitions. [2018-11-18 08:50:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 612 transitions. [2018-11-18 08:50:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:35,168 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 318 states and 619 transitions. [2018-11-18 08:50:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 619 transitions. [2018-11-18 08:50:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:37,137 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 319 states and 620 transitions. [2018-11-18 08:50:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 620 transitions. [2018-11-18 08:50:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:37,615 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 320 states and 624 transitions. [2018-11-18 08:50:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 624 transitions. [2018-11-18 08:50:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:39,278 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 321 states and 626 transitions. [2018-11-18 08:50:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 626 transitions. [2018-11-18 08:50:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:40,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 322 states and 628 transitions. [2018-11-18 08:50:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 628 transitions. [2018-11-18 08:50:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:41,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 323 states and 630 transitions. [2018-11-18 08:50:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 630 transitions. [2018-11-18 08:50:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:41,997 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 328 states and 641 transitions. [2018-11-18 08:50:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 641 transitions. [2018-11-18 08:50:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 08:50:42,584 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:50:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 311 states and 580 transitions. [2018-11-18 08:50:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 580 transitions. [2018-11-18 08:50:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:50:45,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:50:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 325 states and 615 transitions. [2018-11-18 08:51:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 615 transitions. [2018-11-18 08:51:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:07,258 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 329 states and 623 transitions. [2018-11-18 08:51:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 623 transitions. [2018-11-18 08:51:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:10,811 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 333 states and 628 transitions. [2018-11-18 08:51:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 628 transitions. [2018-11-18 08:51:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:14,264 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 337 states and 635 transitions. [2018-11-18 08:51:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 635 transitions. [2018-11-18 08:51:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:15,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 338 states and 636 transitions. [2018-11-18 08:51:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 636 transitions. [2018-11-18 08:51:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:35,317 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 340 states and 638 transitions. [2018-11-18 08:51:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 638 transitions. [2018-11-18 08:51:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:39,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 350 states and 658 transitions. [2018-11-18 08:51:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 658 transitions. [2018-11-18 08:51:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:49,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 352 states and 663 transitions. [2018-11-18 08:51:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 663 transitions. [2018-11-18 08:51:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:51,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:51:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 361 states and 678 transitions. [2018-11-18 08:51:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 678 transitions. [2018-11-18 08:51:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:51:54,367 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:51:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 367 states and 685 transitions. [2018-11-18 08:52:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 685 transitions. [2018-11-18 08:52:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:52:02,850 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 365 states and 682 transitions. [2018-11-18 08:52:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 682 transitions. [2018-11-18 08:52:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:52:03,732 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 360 states and 672 transitions. [2018-11-18 08:52:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 672 transitions. [2018-11-18 08:52:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:52:07,673 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 357 states and 662 transitions. [2018-11-18 08:52:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 662 transitions. [2018-11-18 08:52:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:52:08,748 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 357 states and 660 transitions. [2018-11-18 08:52:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 660 transitions. [2018-11-18 08:52:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 08:52:09,848 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 357 states and 659 transitions. [2018-11-18 08:52:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 659 transitions. [2018-11-18 08:52:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:10,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 361 states and 665 transitions. [2018-11-18 08:52:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 665 transitions. [2018-11-18 08:52:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:15,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 365 states and 671 transitions. [2018-11-18 08:52:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 671 transitions. [2018-11-18 08:52:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:20,626 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 367 states and 675 transitions. [2018-11-18 08:52:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 675 transitions. [2018-11-18 08:52:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:21,103 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 384 states and 710 transitions. [2018-11-18 08:52:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 710 transitions. [2018-11-18 08:52:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:35,279 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 388 states and 718 transitions. [2018-11-18 08:52:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 718 transitions. [2018-11-18 08:52:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:36,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 385 states and 712 transitions. [2018-11-18 08:52:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 712 transitions. [2018-11-18 08:52:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:41,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 398 states and 742 transitions. [2018-11-18 08:52:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 742 transitions. [2018-11-18 08:52:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:47,089 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 392 states and 733 transitions. [2018-11-18 08:52:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 733 transitions. [2018-11-18 08:52:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:51,647 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 389 states and 726 transitions. [2018-11-18 08:52:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 726 transitions. [2018-11-18 08:52:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:56,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:52:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 389 states and 725 transitions. [2018-11-18 08:52:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 725 transitions. [2018-11-18 08:52:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:52:58,174 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:52:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 394 states and 733 transitions. [2018-11-18 08:53:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 733 transitions. [2018-11-18 08:53:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:02,521 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 397 states and 737 transitions. [2018-11-18 08:53:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 737 transitions. [2018-11-18 08:53:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:07,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 397 states and 736 transitions. [2018-11-18 08:53:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 736 transitions. [2018-11-18 08:53:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:09,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 397 states and 735 transitions. [2018-11-18 08:53:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 735 transitions. [2018-11-18 08:53:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:12,955 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 393 states and 726 transitions. [2018-11-18 08:53:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 726 transitions. [2018-11-18 08:53:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:16,769 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 348 states and 624 transitions. [2018-11-18 08:53:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 624 transitions. [2018-11-18 08:53:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:18,047 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 348 states and 622 transitions. [2018-11-18 08:53:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2018-11-18 08:53:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:19,293 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 345 states and 617 transitions. [2018-11-18 08:53:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 617 transitions. [2018-11-18 08:53:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:25,415 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 345 states and 616 transitions. [2018-11-18 08:53:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 616 transitions. [2018-11-18 08:53:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:26,737 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 348 states and 620 transitions. [2018-11-18 08:53:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 620 transitions. [2018-11-18 08:53:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:31,293 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 356 states and 634 transitions. [2018-11-18 08:53:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 634 transitions. [2018-11-18 08:53:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 08:53:38,825 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 360 states and 641 transitions. [2018-11-18 08:53:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 641 transitions. [2018-11-18 08:53:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 08:53:41,738 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 364 states and 646 transitions. [2018-11-18 08:53:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 646 transitions. [2018-11-18 08:53:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 08:53:45,269 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 368 states and 651 transitions. [2018-11-18 08:53:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 651 transitions. [2018-11-18 08:53:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 08:53:50,743 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:53:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:53:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 373 states and 659 transitions. [2018-11-18 08:53:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 659 transitions. [2018-11-18 08:53:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 08:53:57,379 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:53:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:53:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:54:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 08:54:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 382 states and 673 transitions. [2018-11-18 08:54:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 673 transitions. [2018-11-18 08:54:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 08:54:40,673 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 08:54:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:54:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:54:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:54:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:54:40,933 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 76 iterations. [2018-11-18 08:54:41,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 08:54:41 ImpRootNode [2018-11-18 08:54:41,106 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 08:54:41,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:54:41,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:54:41,106 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:54:41,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:55" (3/4) ... [2018-11-18 08:54:41,109 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 08:54:41,224 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3642f500-9ecd-404e-b8f6-194958c865f1/bin-2019/ukojak/witness.graphml [2018-11-18 08:54:41,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:54:41,225 INFO L168 Benchmark]: Toolchain (without parser) took 287913.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 205.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,226 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:54:41,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,227 INFO L168 Benchmark]: Boogie Preprocessor took 29.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,227 INFO L168 Benchmark]: RCFGBuilder took 1615.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.0 MB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,227 INFO L168 Benchmark]: CodeCheck took 285682.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 904.0 MB in the beginning and 1.1 GB in the end (delta: -243.0 MB). Peak memory consumption was 477.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,227 INFO L168 Benchmark]: Witness Printer took 117.67 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:54:41,229 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 270 locations, 2 error locations. UNSAFE Result, 285.4s OverallTime, 76 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161891584 SDtfs, 246955460 SDslu, -1058803726 SDs, 0 SdLazy, -1019798026 SolverSat, 25231528 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50382 GetRequests, 48550 SyntacticMatches, 582 SemanticMatches, 1250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776652 ImplicationChecksByTransitivity, 279.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 6283 NumberOfCodeBlocks, 6283 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 6120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1957749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 75 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1872; [L71] int __return_1528; [L72] int __return_1653; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L17] port_t p13 = 0; [L21] port_t p21 = 0; [L25] port_t p23 = 0; [L29] port_t p31 = 0; [L33] port_t p32 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_uchar() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_uchar() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_uchar() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 [L134] COND FALSE !(!(init__r121 == 0)) [L1987] COND TRUE !(init__r131 == 0) [L1989] COND TRUE !(ep32 == 0) [L1991] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND TRUE !(init__r131 == 0) [L141] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND TRUE !(init__r211 == 0) [L146] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND FALSE !(!(init__r231 == 0)) [L1918] COND TRUE !(init__r211 == 0) [L1920] COND TRUE !(ep13 == 0) [L1922] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND FALSE !(!(init__r311 == 0)) [L1895] COND TRUE !(init__r321 == 0) [L1897] COND TRUE !(ep21 == 0) [L1899] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND TRUE !(init__r321 == 0) [L161] init__tmp___4 = 1 [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1248 = init__tmp___5 [L226] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 [L243] _Bool node1__newmax; [L244] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L251] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(newmax1 == 0) [L270] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE p13_new == nomsg [L275] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L279] mode1 = 1 [L281] _Bool node2__newmax; [L282] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L283] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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 ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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 !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L293] COND TRUE !(newmax2 == 0) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L296] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L298] COND TRUE p21_new == nomsg [L300] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L302] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L304] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L317] mode2 = 1 [L319] _Bool node3__newmax; [L320] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L321] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L327] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L329] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L342] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L344] COND TRUE !(newmax3 == 0) [L346] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L347] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L349] COND TRUE p32_new == nomsg [L351] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L353] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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=3, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] mode3 = 1 [L356] p12_old = p12_new [L357] p12_new = nomsg [L358] p13_old = p13_new [L359] p13_new = nomsg [L360] p21_old = p21_new [L361] p21_new = nomsg [L362] p23_old = p23_new [L363] p23_new = nomsg [L364] p31_old = p31_new [L365] p31_new = nomsg [L366] p32_old = p32_new [L367] p32_new = nomsg [L369] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((int)r1) < 2 [L398] check__tmp = 1 [L399] __return_1394 = check__tmp [L400] main__c1 = __return_1394 [L402] _Bool __tmp_1; [L403] __tmp_1 = main__c1 [L404] _Bool assert__arg; [L405] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND FALSE !(assert__arg == 0) [L413] _Bool node1__newmax; [L414] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(r1 == 255) [L423] r1 = r1 + 1 [L424] COND TRUE !(ep21 == 0) [L426] m1 = p21_old [L427] p21_old = nomsg [L428] COND FALSE !(((int)m1) > ((int)max1)) [L433] COND FALSE !(!(ep31 == 0)) [L442] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=3, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=-128, max1=2, max2=3, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=-128, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=-128, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND FALSE !(((int)m3) > ((int)max3)) [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L559] check__tmp = 0 [L560] __return_1872 = check__tmp [L561] main__c1 = __return_1872 [L563] _Bool __tmp_2; [L564] __tmp_2 = main__c1 [L565] _Bool assert__arg; [L566] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L567] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] [L569] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1615.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.0 MB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. * CodeCheck took 285682.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 904.0 MB in the beginning and 1.1 GB in the end (delta: -243.0 MB). Peak memory consumption was 477.6 MB. Max. memory is 11.5 GB. * Witness Printer took 117.67 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...