./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/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+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/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 4fc1e09d0a185b5e28aca558590d685af7160ef3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-01 19:51:20,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:51:20,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:51:20,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:51:20,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:51:20,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:51:20,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:51:20,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:51:20,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:51:20,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:51:20,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:51:20,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:51:20,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:51:20,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:51:20,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:51:20,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:51:20,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:51:20,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:51:20,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:51:20,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:51:20,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:51:20,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:51:20,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:51:20,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:51:20,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:51:20,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:51:20,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:51:20,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:51:20,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:51:20,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:51:20,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:51:20,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:51:20,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:51:20,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:51:20,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:51:20,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:51:20,656 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 19:51:20,666 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:51:20,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:51:20,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:51:20,667 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 19:51:20,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:51:20,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:51:20,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:51:20,669 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 19:51:20,669 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 19:51:20,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 19:51:20,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:51:20,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:51:20,670 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_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/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 -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2018-12-01 19:51:20,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:51:20,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:51:20,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:51:20,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:51:20,708 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:51:20,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-01 19:51:20,753 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/data/004ced570/e801a648b5c946a7a1c58db7c36ca421/FLAG55fe9292c [2018-12-01 19:51:21,175 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:51:21,175 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-01 19:51:21,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/data/004ced570/e801a648b5c946a7a1c58db7c36ca421/FLAG55fe9292c [2018-12-01 19:51:21,189 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/data/004ced570/e801a648b5c946a7a1c58db7c36ca421 [2018-12-01 19:51:21,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:51:21,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:51:21,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:51:21,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:51:21,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:51:21,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d8803c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21, skipping insertion in model container [2018-12-01 19:51:21,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:51:21,230 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:51:21,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:51:21,423 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:51:21,523 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:51:21,534 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:51:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21 WrapperNode [2018-12-01 19:51:21,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:51:21,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:51:21,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:51:21,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:51:21,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:51:21,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:51:21,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:51:21,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:51:21,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... [2018-12-01 19:51:21,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:51:21,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:51:21,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:51:21,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:51:21,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/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-12-01 19:51:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:51:21,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:51:22,661 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:51:22,661 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-01 19:51:22,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:22 BoogieIcfgContainer [2018-12-01 19:51:22,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:51:22,662 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 19:51:22,662 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 19:51:22,670 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 19:51:22,670 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:22" (1/1) ... [2018-12-01 19:51:22,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:51:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2018-12-01 19:51:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2018-12-01 19:51:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 19:51:22,718 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 184 states and 329 transitions. [2018-12-01 19:51:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 329 transitions. [2018-12-01 19:51:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:23,231 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 186 states and 333 transitions. [2018-12-01 19:51:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 333 transitions. [2018-12-01 19:51:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:23,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 197 states and 360 transitions. [2018-12-01 19:51:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 360 transitions. [2018-12-01 19:51:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:23,925 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 199 states and 362 transitions. [2018-12-01 19:51:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 362 transitions. [2018-12-01 19:51:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:23,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 206 states and 380 transitions. [2018-12-01 19:51:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 380 transitions. [2018-12-01 19:51:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:24,728 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 207 states and 381 transitions. [2018-12-01 19:51:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 381 transitions. [2018-12-01 19:51:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 19:51:24,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 207 states and 379 transitions. [2018-12-01 19:51:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 379 transitions. [2018-12-01 19:51:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:24,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 210 states and 387 transitions. [2018-12-01 19:51:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 387 transitions. [2018-12-01 19:51:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:28,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 214 states and 393 transitions. [2018-12-01 19:51:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 393 transitions. [2018-12-01 19:51:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:28,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 226 states and 423 transitions. [2018-12-01 19:51:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 423 transitions. [2018-12-01 19:51:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:33,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 235 states and 442 transitions. [2018-12-01 19:51:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 442 transitions. [2018-12-01 19:51:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:39,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 241 states and 456 transitions. [2018-12-01 19:51:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 456 transitions. [2018-12-01 19:51:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:47,151 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 249 states and 477 transitions. [2018-12-01 19:51:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 477 transitions. [2018-12-01 19:51:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:56,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:56,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-12-01 19:51:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 253 states and 483 transitions. [2018-12-01 19:51:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 483 transitions. [2018-12-01 19:51:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:58,666 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 257 states and 491 transitions. [2018-12-01 19:51:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 491 transitions. [2018-12-01 19:51:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:59,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 259 states and 496 transitions. [2018-12-01 19:51:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 496 transitions. [2018-12-01 19:51:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:59,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:51:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:51:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:51:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 259 states and 495 transitions. [2018-12-01 19:51:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 495 transitions. [2018-12-01 19:51:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 19:51:59,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:51:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:00,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-12-01 19:52:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 266 states and 514 transitions. [2018-12-01 19:52:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 514 transitions. [2018-12-01 19:52:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:04,022 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:04,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-12-01 19:52:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 270 states and 520 transitions. [2018-12-01 19:52:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 520 transitions. [2018-12-01 19:52:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:05,343 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 274 states and 526 transitions. [2018-12-01 19:52:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 526 transitions. [2018-12-01 19:52:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:06,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 278 states and 535 transitions. [2018-12-01 19:52:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 535 transitions. [2018-12-01 19:52:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:11,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 282 states and 541 transitions. [2018-12-01 19:52:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 541 transitions. [2018-12-01 19:52:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:12,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 291 states and 562 transitions. [2018-12-01 19:52:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 562 transitions. [2018-12-01 19:52:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:18,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 295 states and 568 transitions. [2018-12-01 19:52:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 568 transitions. [2018-12-01 19:52:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:18,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 303 states and 589 transitions. [2018-12-01 19:52:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 589 transitions. [2018-12-01 19:52:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:29,922 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 305 states and 592 transitions. [2018-12-01 19:52:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 592 transitions. [2018-12-01 19:52:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:30,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 307 states and 595 transitions. [2018-12-01 19:52:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 595 transitions. [2018-12-01 19:52:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:32,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 314 states and 611 transitions. [2018-12-01 19:52:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 611 transitions. [2018-12-01 19:52:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:37,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 315 states and 613 transitions. [2018-12-01 19:52:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 613 transitions. [2018-12-01 19:52:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 19:52:39,165 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:52:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:52:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 298 states and 552 transitions. [2018-12-01 19:52:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 552 transitions. [2018-12-01 19:52:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:52:43,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:52:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:52:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 312 states and 587 transitions. [2018-12-01 19:53:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 587 transitions. [2018-12-01 19:53:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:14,881 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 316 states and 592 transitions. [2018-12-01 19:53:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 592 transitions. [2018-12-01 19:53:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:21,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 324 states and 607 transitions. [2018-12-01 19:53:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 607 transitions. [2018-12-01 19:53:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:28,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 328 states and 612 transitions. [2018-12-01 19:53:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 612 transitions. [2018-12-01 19:53:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:37,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 337 states and 630 transitions. [2018-12-01 19:53:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 630 transitions. [2018-12-01 19:53:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:44,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:44,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-12-01 19:53:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 341 states and 635 transitions. [2018-12-01 19:53:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 635 transitions. [2018-12-01 19:53:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:47,948 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 345 states and 646 transitions. [2018-12-01 19:53:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 646 transitions. [2018-12-01 19:53:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:53,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:53:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 347 states and 647 transitions. [2018-12-01 19:53:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 647 transitions. [2018-12-01 19:53:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:55,251 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:55,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-12-01 19:53:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:53:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 351 states and 652 transitions. [2018-12-01 19:53:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 652 transitions. [2018-12-01 19:53:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:53:58,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:53:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:53:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:54:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 355 states and 657 transitions. [2018-12-01 19:54:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 657 transitions. [2018-12-01 19:54:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:54:03,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:54:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:54:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:54:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 363 states and 674 transitions. [2018-12-01 19:54:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 674 transitions. [2018-12-01 19:54:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:54:06,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:54:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:54:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:54:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 365 states and 676 transitions. [2018-12-01 19:54:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 676 transitions. [2018-12-01 19:54:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:54:12,287 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:54:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:54:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:54:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 375 states and 696 transitions. [2018-12-01 19:54:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 696 transitions. [2018-12-01 19:54:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:54:25,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:54:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:54:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:54:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 377 states and 701 transitions. [2018-12-01 19:54:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 701 transitions. [2018-12-01 19:54:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:54:27,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:54:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:54:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:54:35,187 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-01 19:54:45,962 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-01 19:55:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 386 states and 717 transitions. [2018-12-01 19:55:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 717 transitions. [2018-12-01 19:55:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:09,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 390 states and 720 transitions. [2018-12-01 19:55:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 720 transitions. [2018-12-01 19:55:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:21,187 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 387 states and 713 transitions. [2018-12-01 19:55:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 713 transitions. [2018-12-01 19:55:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:26,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 385 states and 710 transitions. [2018-12-01 19:55:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 710 transitions. [2018-12-01 19:55:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:27,749 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 382 states and 699 transitions. [2018-12-01 19:55:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 699 transitions. [2018-12-01 19:55:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:29,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:29,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-12-01 19:55:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 382 states and 696 transitions. [2018-12-01 19:55:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 696 transitions. [2018-12-01 19:55:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:30,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 388 states and 706 transitions. [2018-12-01 19:55:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 706 transitions. [2018-12-01 19:55:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:38,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 386 states and 702 transitions. [2018-12-01 19:55:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 702 transitions. [2018-12-01 19:55:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:55:39,996 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:40,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-12-01 19:55:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 386 states and 701 transitions. [2018-12-01 19:55:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 701 transitions. [2018-12-01 19:55:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:55:41,566 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:41,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-12-01 19:55:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 390 states and 707 transitions. [2018-12-01 19:55:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 707 transitions. [2018-12-01 19:55:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:55:49,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:55:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:55:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 394 states and 713 transitions. [2018-12-01 19:55:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 713 transitions. [2018-12-01 19:55:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:55:56,186 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:55:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:55:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 411 states and 749 transitions. [2018-12-01 19:56:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 749 transitions. [2018-12-01 19:56:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:16,643 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 413 states and 752 transitions. [2018-12-01 19:56:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 752 transitions. [2018-12-01 19:56:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:18,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 417 states and 759 transitions. [2018-12-01 19:56:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 759 transitions. [2018-12-01 19:56:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:20,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 426 states and 776 transitions. [2018-12-01 19:56:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 776 transitions. [2018-12-01 19:56:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:31,347 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 433 states and 788 transitions. [2018-12-01 19:56:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 788 transitions. [2018-12-01 19:56:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:39,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 435 states and 789 transitions. [2018-12-01 19:56:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 789 transitions. [2018-12-01 19:56:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:42,531 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 432 states and 783 transitions. [2018-12-01 19:56:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 783 transitions. [2018-12-01 19:56:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:49,699 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:56:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:56:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 426 states and 774 transitions. [2018-12-01 19:56:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 774 transitions. [2018-12-01 19:56:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:56:55,536 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:56:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:56:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 423 states and 764 transitions. [2018-12-01 19:57:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 764 transitions. [2018-12-01 19:57:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:03,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 425 states and 769 transitions. [2018-12-01 19:57:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 769 transitions. [2018-12-01 19:57:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:08,457 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 427 states and 773 transitions. [2018-12-01 19:57:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 773 transitions. [2018-12-01 19:57:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:09,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 427 states and 772 transitions. [2018-12-01 19:57:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 772 transitions. [2018-12-01 19:57:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:16,714 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 427 states and 771 transitions. [2018-12-01 19:57:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 771 transitions. [2018-12-01 19:57:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:19,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 438 states and 796 transitions. [2018-12-01 19:57:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 796 transitions. [2018-12-01 19:57:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:25,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 440 states and 802 transitions. [2018-12-01 19:57:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 802 transitions. [2018-12-01 19:57:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:27,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 441 states and 803 transitions. [2018-12-01 19:57:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 803 transitions. [2018-12-01 19:57:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:29,351 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 441 states and 802 transitions. [2018-12-01 19:57:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 802 transitions. [2018-12-01 19:57:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:31,263 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 448 states and 815 transitions. [2018-12-01 19:57:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 815 transitions. [2018-12-01 19:57:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:37,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 448 states and 814 transitions. [2018-12-01 19:57:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 814 transitions. [2018-12-01 19:57:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:40,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:40,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-12-01 19:57:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 450 states and 819 transitions. [2018-12-01 19:57:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 819 transitions. [2018-12-01 19:57:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:42,427 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 442 states and 799 transitions. [2018-12-01 19:57:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 799 transitions. [2018-12-01 19:57:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:48,996 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:57:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:57:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 398 states and 699 transitions. [2018-12-01 19:57:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 699 transitions. [2018-12-01 19:57:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:57:54,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:57:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:57:54,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-12-01 19:58:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:58:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 403 states and 707 transitions. [2018-12-01 19:58:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 707 transitions. [2018-12-01 19:58:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:58:04,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:58:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:58:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:58:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:58:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 411 states and 719 transitions. [2018-12-01 19:58:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 719 transitions. [2018-12-01 19:58:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:58:15,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:58:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:58:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:58:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:58:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 411 states and 718 transitions. [2018-12-01 19:58:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 718 transitions. [2018-12-01 19:58:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 19:58:17,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:58:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:58:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:58:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:58:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 411 states and 717 transitions. [2018-12-01 19:58:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 717 transitions. [2018-12-01 19:58:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 19:58:20,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:58:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:58:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:58:41,650 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-01 19:59:10,324 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-01 19:59:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 19:59:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 420 states and 730 transitions. [2018-12-01 19:59:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 730 transitions. [2018-12-01 19:59:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 19:59:23,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 19:59:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:59:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:59:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:59:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:59:23,253 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 83 iterations. [2018-12-01 19:59:23,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 07:59:23 ImpRootNode [2018-12-01 19:59:23,361 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 19:59:23,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:59:23,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:59:23,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:59:23,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:22" (3/4) ... [2018-12-01 19:59:23,363 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 19:59:23,445 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_970a9125-eaf0-424a-b77d-b3c3ce85eb5e/bin-2019/ukojak/witness.graphml [2018-12-01 19:59:23,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:59:23,446 INFO L168 Benchmark]: Toolchain (without parser) took 482255.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.7 MB in the beginning and 705.5 MB in the end (delta: 246.2 MB). Peak memory consumption was 363.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: RCFGBuilder took 1060.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.1 MB in the end (delta: 230.7 MB). Peak memory consumption was 230.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: CodeCheck took 480699.02 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -16.3 MB). Free memory was 880.1 MB in the beginning and 736.9 MB in the end (delta: 143.2 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,447 INFO L168 Benchmark]: Witness Printer took 84.60 ms. Allocated memory is still 1.1 GB. Free memory was 736.9 MB in the beginning and 705.5 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-01 19:59:23,448 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, 247 locations, 1 error locations. UNSAFE Result, 480.5s OverallTime, 83 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1812386672 SDtfs, 1743946866 SDslu, 1853975638 SDs, 0 SdLazy, -279272328 SolverSat, 402663464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 106.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56176 GetRequests, 54216 SyntacticMatches, 536 SemanticMatches, 1424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020346 ImplicationChecksByTransitivity, 473.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 6961 NumberOfCodeBlocks, 6961 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 6790 ConstructedInterpolants, 0 QuantifiedInterpolants, 2314262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 82 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: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 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; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 [L133] COND FALSE !(!(init__r121 == 0)) [L1782] COND TRUE !(init__r131 == 0) [L1784] COND TRUE !(ep32 == 0) [L1786] init__tmp = 1 [L137] init__r122 = (_Bool)init__tmp [L138] COND TRUE !(init__r131 == 0) [L140] init__tmp___0 = 1 [L142] init__r132 = (_Bool)init__tmp___0 [L143] COND TRUE !(init__r211 == 0) [L145] init__tmp___1 = 1 [L147] init__r212 = (_Bool)init__tmp___1 [L148] COND FALSE !(!(init__r231 == 0)) [L1713] COND TRUE !(init__r211 == 0) [L1715] COND TRUE !(ep13 == 0) [L1717] init__tmp___2 = 1 [L152] init__r232 = (_Bool)init__tmp___2 [L153] COND FALSE !(!(init__r311 == 0)) [L1690] COND TRUE !(init__r321 == 0) [L1692] COND TRUE !(ep21 == 0) [L1694] init__tmp___3 = 1 [L157] init__r312 = (_Bool)init__tmp___3 [L158] COND TRUE !(init__r321 == 0) [L160] init__tmp___4 = 1 [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L252] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L265] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L267] COND TRUE !(newmax1 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L270] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L290] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L292] COND TRUE !(newmax2 == 0) [L294] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] COND TRUE p21_new == nomsg [L299] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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] [L301] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L303] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L328] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L341] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L343] COND TRUE !(newmax3 == 0) [L345] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L346] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L348] COND TRUE p32_new == nomsg [L350] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, 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] [L352] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p13_old=-1, p21=0, p21_new=25, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=26, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=0, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, p21=0, p21_new=-1, p21_old=25, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=26, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 [L423] COND TRUE !(ep21 == 0) [L425] m1 = p21_old [L426] p21_old = nomsg [L427] COND FALSE !(((int)m1) > ((int)max1)) [L432] COND FALSE !(!(ep31 == 0)) [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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=26, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 [L444] COND TRUE ((int)max1) == ((int)id1) [L446] 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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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=26, 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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=0, m3=26, max1=27, max2=25, max3=26, 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=27, 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=26, 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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=26, max1=27, max2=26, max3=26, 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=27, 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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=26, max1=27, max2=26, max3=26, 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=27, 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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=26, max1=27, max2=26, max3=26, 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=27, 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 TRUE ((int)m3) > ((int)max3) [L505] max3 = m3 [L506] node3__newmax = 1 [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=27, id2=25, id3=26, m1=25, m2=26, m3=27, max1=27, max2=26, max3=27, mode1=0, mode2=0, mode3=0, 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=-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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1060.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.1 MB in the end (delta: 230.7 MB). Peak memory consumption was 230.7 MB. Max. memory is 11.5 GB. * CodeCheck took 480699.02 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -16.3 MB). Free memory was 880.1 MB in the beginning and 736.9 MB in the end (delta: 143.2 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. * Witness Printer took 84.60 ms. Allocated memory is still 1.1 GB. Free memory was 736.9 MB in the beginning and 705.5 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...