./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/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 b3efd85eaecafa9f5850339d4919cc79d62d9539 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 18:16:12,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:16:12,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:16:12,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:16:12,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:16:12,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:16:12,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:16:12,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:16:12,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:16:12,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:16:12,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:16:12,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:16:12,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:16:12,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:16:12,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:16:12,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:16:12,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:16:12,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:16:12,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:16:12,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:16:12,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:16:12,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:16:12,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:16:12,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:16:12,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:16:12,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:16:12,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:16:12,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:16:12,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:16:12,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:16:12,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:16:12,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:16:12,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:16:12,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:16:12,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:16:12,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:16:12,642 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 18:16:12,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:16:12,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:16:12,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:16:12,657 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 18:16:12,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 18:16:12,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 18:16:12,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:16:12,658 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:16:12,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:16:12,659 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:16:12,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:16:12,660 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:16:12,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:16:12,661 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 18:16:12,661 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 18:16:12,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:16:12,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:16:12,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:16:12,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:16:12,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:16:12,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:16:12,662 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 18:16:12,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:16:12,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:16:12,663 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_947e730f-449b-4221-87b3-39848c57a435/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 -> b3efd85eaecafa9f5850339d4919cc79d62d9539 [2018-11-18 18:16:12,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:16:12,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:16:12,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:16:12,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:16:12,709 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:16:12,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 18:16:12,759 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/data/1e567037e/3a977964256b4e06becbaf168afdacdd/FLAG26016e4e8 [2018-11-18 18:16:13,168 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:16:13,169 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 18:16:13,179 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/data/1e567037e/3a977964256b4e06becbaf168afdacdd/FLAG26016e4e8 [2018-11-18 18:16:13,190 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/data/1e567037e/3a977964256b4e06becbaf168afdacdd [2018-11-18 18:16:13,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:16:13,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:16:13,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:16:13,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:16:13,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:16:13,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae989df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13, skipping insertion in model container [2018-11-18 18:16:13,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:16:13,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:16:13,434 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:16:13,444 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:16:13,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:16:13,535 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:16:13,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13 WrapperNode [2018-11-18 18:16:13,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:16:13,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:16:13,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:16:13,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:16:13,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:16:13,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:16:13,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:16:13,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:16:13,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... [2018-11-18 18:16:13,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:16:13,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:16:13,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:16:13,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:16:13,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:16:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 18:16:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:16:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:16:15,490 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:16:15,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:16:15 BoogieIcfgContainer [2018-11-18 18:16:15,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:16:15,491 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 18:16:15,491 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 18:16:15,500 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 18:16:15,500 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:16:15" (1/1) ... [2018-11-18 18:16:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:16:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 18:16:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 18:16:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 18:16:15,541 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-18 18:16:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-18 18:16:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 18:16:15,963 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-18 18:16:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-18 18:16:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 18:16:16,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-18 18:16:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-18 18:16:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 18:16:16,695 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-18 18:16:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-18 18:16:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 18:16:17,300 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-18 18:16:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-18 18:16:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 18:16:18,026 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-18 18:16:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-18 18:16:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 18:16:18,868 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-18 18:16:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-18 18:16:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 18:16:19,088 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-18 18:16:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-18 18:16:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 18:16:19,144 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-11-18 18:16:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-11-18 18:16:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 18:16:20,665 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-11-18 18:16:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-11-18 18:16:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 18:16:20,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 88 states and 159 transitions. [2018-11-18 18:16:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 159 transitions. [2018-11-18 18:16:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 18:16:25,529 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 106 states and 196 transitions. [2018-11-18 18:16:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 196 transitions. [2018-11-18 18:16:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 18:16:30,717 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 120 states and 221 transitions. [2018-11-18 18:16:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 221 transitions. [2018-11-18 18:16:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:16:35,462 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 130 states and 243 transitions. [2018-11-18 18:16:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 243 transitions. [2018-11-18 18:16:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 18:16:40,312 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 133 states and 250 transitions. [2018-11-18 18:16:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 250 transitions. [2018-11-18 18:16:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:16:41,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 144 states and 275 transitions. [2018-11-18 18:16:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 275 transitions. [2018-11-18 18:16:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 18:16:46,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 148 states and 284 transitions. [2018-11-18 18:16:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 284 transitions. [2018-11-18 18:16:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:16:48,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 151 states and 292 transitions. [2018-11-18 18:16:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 292 transitions. [2018-11-18 18:16:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:16:50,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 156 states and 301 transitions. [2018-11-18 18:16:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 301 transitions. [2018-11-18 18:16:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:16:52,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 157 states and 302 transitions. [2018-11-18 18:16:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 302 transitions. [2018-11-18 18:16:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 18:16:53,002 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:16:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:16:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 160 states and 308 transitions. [2018-11-18 18:16:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 308 transitions. [2018-11-18 18:16:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:16:54,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:16:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:16:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 171 states and 332 transitions. [2018-11-18 18:17:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 332 transitions. [2018-11-18 18:17:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:17:02,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 175 states and 339 transitions. [2018-11-18 18:17:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 339 transitions. [2018-11-18 18:17:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 18:17:03,929 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 178 states and 345 transitions. [2018-11-18 18:17:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 345 transitions. [2018-11-18 18:17:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:04,893 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 208 states and 438 transitions. [2018-11-18 18:17:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 438 transitions. [2018-11-18 18:17:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:19,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 209 states and 440 transitions. [2018-11-18 18:17:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 440 transitions. [2018-11-18 18:17:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:20,307 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 213 states and 448 transitions. [2018-11-18 18:17:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 448 transitions. [2018-11-18 18:17:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:22,358 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 216 states and 457 transitions. [2018-11-18 18:17:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 457 transitions. [2018-11-18 18:17:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:24,240 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 217 states and 458 transitions. [2018-11-18 18:17:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 458 transitions. [2018-11-18 18:17:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 18:17:25,521 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 220 states and 464 transitions. [2018-11-18 18:17:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 464 transitions. [2018-11-18 18:17:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:17:27,237 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:37,847 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-18 18:17:38,475 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-18 18:17:39,716 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-11-18 18:17:40,012 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-18 18:17:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 254 states and 571 transitions. [2018-11-18 18:17:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 571 transitions. [2018-11-18 18:17:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:17:54,942 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:17:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:17:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 258 states and 604 transitions. [2018-11-18 18:17:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 604 transitions. [2018-11-18 18:17:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:17:57,882 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:17:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:17:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 266 states and 627 transitions. [2018-11-18 18:18:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 627 transitions. [2018-11-18 18:18:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:04,207 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 268 states and 631 transitions. [2018-11-18 18:18:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 631 transitions. [2018-11-18 18:18:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:05,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 269 states and 632 transitions. [2018-11-18 18:18:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 632 transitions. [2018-11-18 18:18:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:06,669 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 273 states and 646 transitions. [2018-11-18 18:18:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 646 transitions. [2018-11-18 18:18:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:10,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 274 states and 647 transitions. [2018-11-18 18:18:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 647 transitions. [2018-11-18 18:18:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:11,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 275 states and 648 transitions. [2018-11-18 18:18:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 648 transitions. [2018-11-18 18:18:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:13,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 278 states and 656 transitions. [2018-11-18 18:18:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 656 transitions. [2018-11-18 18:18:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 18:18:15,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 281 states and 664 transitions. [2018-11-18 18:18:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 664 transitions. [2018-11-18 18:18:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:17,984 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 287 states and 678 transitions. [2018-11-18 18:18:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 678 transitions. [2018-11-18 18:18:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:26,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 291 states and 685 transitions. [2018-11-18 18:18:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 685 transitions. [2018-11-18 18:18:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:29,226 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 304 states and 708 transitions. [2018-11-18 18:18:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 708 transitions. [2018-11-18 18:18:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:40,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 308 states and 731 transitions. [2018-11-18 18:18:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 731 transitions. [2018-11-18 18:18:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:43,828 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 311 states and 760 transitions. [2018-11-18 18:18:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 760 transitions. [2018-11-18 18:18:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:46,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 313 states and 764 transitions. [2018-11-18 18:18:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 764 transitions. [2018-11-18 18:18:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 18:18:47,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:18:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:18:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 316 states and 768 transitions. [2018-11-18 18:18:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 768 transitions. [2018-11-18 18:18:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:18:49,887 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:18:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:18:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 326 states and 793 transitions. [2018-11-18 18:19:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 793 transitions. [2018-11-18 18:19:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:19:02,095 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 324 states and 793 transitions. [2018-11-18 18:19:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 793 transitions. [2018-11-18 18:19:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:19:04,531 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 328 states and 807 transitions. [2018-11-18 18:19:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 807 transitions. [2018-11-18 18:19:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:19:07,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 329 states and 812 transitions. [2018-11-18 18:19:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 812 transitions. [2018-11-18 18:19:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:19:08,481 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 331 states and 820 transitions. [2018-11-18 18:19:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 820 transitions. [2018-11-18 18:19:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 18:19:09,544 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 332 states and 825 transitions. [2018-11-18 18:19:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 825 transitions. [2018-11-18 18:19:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:10,323 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 347 states and 865 transitions. [2018-11-18 18:19:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 865 transitions. [2018-11-18 18:19:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:26,954 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 350 states and 873 transitions. [2018-11-18 18:19:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 873 transitions. [2018-11-18 18:19:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:29,081 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 354 states and 890 transitions. [2018-11-18 18:19:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 890 transitions. [2018-11-18 18:19:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:32,217 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 358 states and 899 transitions. [2018-11-18 18:19:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 899 transitions. [2018-11-18 18:19:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:36,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 359 states and 900 transitions. [2018-11-18 18:19:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 900 transitions. [2018-11-18 18:19:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:37,669 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 362 states and 906 transitions. [2018-11-18 18:19:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 906 transitions. [2018-11-18 18:19:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 18:19:40,093 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 365 states and 912 transitions. [2018-11-18 18:19:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 912 transitions. [2018-11-18 18:19:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:19:42,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 370 states and 924 transitions. [2018-11-18 18:19:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 924 transitions. [2018-11-18 18:19:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:19:51,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 374 states and 939 transitions. [2018-11-18 18:19:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 939 transitions. [2018-11-18 18:19:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:19:54,403 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 376 states and 943 transitions. [2018-11-18 18:19:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 943 transitions. [2018-11-18 18:19:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 18:19:55,518 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:19:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:19:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:19:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 378 states and 950 transitions. [2018-11-18 18:19:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 950 transitions. [2018-11-18 18:19:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:19:56,724 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:19:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:20:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:20:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:20:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 384 states and 963 transitions. [2018-11-18 18:20:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 963 transitions. [2018-11-18 18:20:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:20:07,969 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:20:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:20:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:20:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:20:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 386 states and 968 transitions. [2018-11-18 18:20:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 968 transitions. [2018-11-18 18:20:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:20:09,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:20:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:20:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:20:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:20:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 390 states and 983 transitions. [2018-11-18 18:20:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 983 transitions. [2018-11-18 18:20:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 18:20:12,035 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:20:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:20:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:20:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 18:20:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 392 states and 987 transitions. [2018-11-18 18:20:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 987 transitions. [2018-11-18 18:20:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 18:20:13,233 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 18:20:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:20:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:20:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:20:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 18:20:16,529 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 69 iterations. [2018-11-18 18:20:16,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 06:20:16 ImpRootNode [2018-11-18 18:20:16,663 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 18:20:16,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:20:16,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:20:16,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:20:16,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:16:15" (3/4) ... [2018-11-18 18:20:16,668 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 18:20:16,796 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_947e730f-449b-4221-87b3-39848c57a435/bin-2019/ukojak/witness.graphml [2018-11-18 18:20:16,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:20:16,797 INFO L168 Benchmark]: Toolchain (without parser) took 243602.86 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 960.3 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 235.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,797 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:20:16,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,798 INFO L168 Benchmark]: Boogie Preprocessor took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,798 INFO L168 Benchmark]: RCFGBuilder took 1903.55 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: 59.9 MB). Peak memory consumption was 255.9 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,799 INFO L168 Benchmark]: CodeCheck took 241172.01 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -950.9 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,799 INFO L168 Benchmark]: Witness Printer took 132.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-18 18:20:16,801 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, 130 locations, 1 error locations. UNSAFE Result, 241.0s OverallTime, 69 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125158396 SDtfs, -1133205668 SDslu, 1311187228 SDs, 0 SdLazy, -395161968 SolverSat, -183064812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 202.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25731 GetRequests, 23056 SyntacticMatches, 1479 SemanticMatches, 1196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869440 ImplicationChecksByTransitivity, 224.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 2307 NumberOfCodeBlocks, 2307 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2187 ConstructedInterpolants, 0 QuantifiedInterpolants, 1597188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 10 PerfectInterpolantSequences, 250/1491 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND TRUE \read(ep13) [L318] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND TRUE \read(r311) [L343] COND TRUE \read(ep12) [L344] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 1 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=127, m2=6, m3=2, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND FALSE !((int )r1 < 1) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=3, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] nl1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=-1, m3=-1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=-1, m3=-1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=-1, m3=-1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L601] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=3, id2=5, id3=4, m1=4, m2=-1, m3=-1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1903.55 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: 59.9 MB). Peak memory consumption was 255.9 MB. Max. memory is 11.5 GB. * CodeCheck took 241172.01 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -950.9 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. * Witness Printer took 132.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...